Graph Theory Quiz

What is the condition for a connected multigraph to have an Euler circuit?

• There are exactly two vertices of odd degree

• Each vertex has an even degree

• Each vertex has an odd degree

• There are exactly two vertices of even degree

What is the condition for a connected multigraph to have an Euler path but not an Euler circuit?

• There are exactly two vertices of odd degree

• Each vertex has an even degree

• There are exactly two vertices of even degree

• Each vertex has an odd degree

In the given graph, what is the degree of vertex R1?

• 3

• 2

• 1

• 0

In the given graph, what is the degree of vertex R9?

• 0

• 1

• 2

• 3

In the given graph, what is the degree of vertex R5?

• 3

• 2

• 1

• 0

In the given graph, what is the degree of vertex R7?

• 3

• 0

• 1

• 2

In the given graph, what is the degree of vertex R3?

• 0

• 1

• 2

• 3

In the given graph, what is the degree of vertex R6?

• 0

• 1

• 2

• 3

In the given graph, what is the degree of vertex R2?

• 1

• 3

• 0

• 2

In the given graph, what is the degree of vertex R4?

• 0

• 1

• 3

• 2