untitled

What is the degree of vertex 4?

• 3

• 4

• 5

• 7

A perfect path for the postman is:

• a path that crosses every road exactly once, and returns to the same starting point.

• a path that crosses every road exactly once, and returns to a different starting point.

• a path that does not travel along every road.

• a path that travel along every road twice.

A connected graph with no cycles

• Isomorphic graph

• Tree

• Planar graph

• Complete graph

Which vocabulary term is illustrated through the diagram?

• Minimal Spanning Tree

• Four Color Theorem

• Cycle

• Vertices

A Hamilton Circuit must touch every __________ once and only once

• Vertex

• Edge

• Loop

• Degree

Choose the correct term to match each definition: Lines or curves that connect vertices.

• Regions

• Vertices

• Edges

• Paths

In column and row C are all zeros. What can you tell about vertex C?

• Vertex A connects with only two other vertices

• Vertex C is not connected to any other vertices.

• Vertex B does not connect to Vertex A

• Vertex C is connected to all the other vertices

Which of the following is not a path from D to A/

• DCA

• DEDCCA

• DCCA

• DECDA

• All of the above are paths from D to A

What is the degree of Vertex D?

• 1

• 2

• 3

• 4

• 5

Which is possible for the graph?

• Euler Path

• Euler Circuit

• Hamilton Path

• Hamilton Circuit

• None of the above