Graph Theory I

A sequence of adjacent vertices and the edges connecting them is called a

• Path

• Loop

• Circuit

The number of edges that connect to a vertex is called the​ _____ of the vertex.

• circuit

• path

• loop

• degree

• bridge

The number of odd vertices in the graph above is:

• 3

• 4

• 5

• 6

How many bridges in the above graph?

• None

• One

• Two

• Three

The following graph is connected. True/False

• True

• False

• Not possible to determine

The diagram on the right is a floor plan. Letting vertices represent the room and the​ outside, and edges represent the connecting​ doors, which graph correctly models the floor​ plan?

• 
• 
• Not one of the above

I enjoyed the quiz!

• Yes!

• No!

• Not sure...:)