Graph Theory Review

How many vertices does the graph contain?

• 2

• 3

• 4

• 5

Tags

CCSS.6.G.A.4

How many edges does the graph contain?

• 5

• 6

• 7

• 8

What is the degree of vertex 4?

• 3

• 4

• 5

• 7

An edge that begins and ends at the same vertex.

• Multiple edges

• Vertices

• Loop

• Node

Tags

CCSS.6.G.A.4

A graph is complete if....

• there are no isolated vertices

• each vertex has an edge coming out of it

• all vertices are directly connected to all other vertices

• the graph is in shape of a geometric shape

What is the weight of circuit A, B, C, A

• 4

• 10

• 6

• 8

Tags

CCSS.8.EE.C.8C

What is the chromatic number of this graph?

• 4

• 3

• 5

• 8

A Hamilton Circuit must touch every __________ once and only once

• Vertex

• Edge

• Loop

• Degree

Which of the following is an example of a Hamilton Circuit starting at A?

• A, G, C, B, A

• A, B, C, D, E, F, D, C, G, A

• A, B, C, G, F, E, D

• A, G, F, E, D, C, B, A

Which of the graphs below is a spanning tree of this connected graph?

• 
• 
• 
•