Graph Theory Discrete Review

Which of the following graphs is isomorphic to

• A

• B

• C

• D

Circuits start and stop at 

• same vertex
• different vertices

Tracing all edges on a figure without picking up your pencil and repeating and starting and stopping in the same spot

• Euler Circuit
• Euler Path

Euler paths must touch

• all edges
• all vertices

Find a Hamilton circuit from D using the Nearest Neighbor Alogrithm.

• DAEBCD
• DBEACD
• DABECD
• DCABED

What is the weight of edge AC?

• 5
• 6
• 3
• 11

What is the degree of vertex 4?

• 3

• 4

• 5

• 7

Which is an example of a disconnected graph?

• 
• 
• 
• 
• None are disconnected graphs

An edge that begins and ends at the same vertex.

• Multiple edges

• Vertices

• Loop

• Node

A Hamilton Circuit must touch every __________ once and only once

• Vertex

• Edge

• Loop

• Degree