Graph Theory Test Review

Which vertices are adjacent to E?

• B and C

• B, C, D, and A

• B

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

Tags

CCSS.6.G.A.3

Which is an example of a disconnected graph?

• 
• 
• 
• 
• None are disconnected graphs

Tags

CCSS.5.G.A.2

Which of the following is a loop?

• BC

• EE

• AB

• BF

• none

Tags

CCSS.4.G.A.1

CCSS.HSG.CO.A.1

What is the degree of vertex B?

• 1

• 2

• 3

• 4

• 5

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

Graphs that contain Euler Circuits have...

• 0 odd vertices.

• 1 odd vertex.

• 2 odd vertices.

• more than 2 odd vertices.

This graph will have an Euler Circuit.

• True

• False

A Hamilton Circuit must touch every __________ once and only once

• Vertex

• Edge

• Loop

• Degree

Use the Nearest Neighbor Method to find a Hamilton Circuit starting at vertex A?

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

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

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

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

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