Quiz_Graph_Theory

A loop is when

• there is a path going from a vertex back to itself

• connects two vertices to each other

• if it were removed, the graph would be disconnected

• An edge that starts and ends at the same vertex

What is the total number of simple undirected graphs possible with 5 vertices?

• 1024

• 32

• 2048

• 512

A trivial graph consists of

• one vertex and one edge

• one vertex only

• one edge and two vertices

• one edge only

Which set represents the vertices of the graph?

• {1,2}, {2,3}. {2,4}, {4,5}, {4,6}

• {1, 2, 3, 4, 5, 6,}

• {1, 2, 3, 4, 5, 6, 7}

• {1,2}, {2,3}. {2,4}, {4,5}, {4,6}, {6,7}

Which two vertices are adjacent vertices?

• 5 is adjacent to 6

• 3 is adjacent to 6

• 4 is adjacent to 1

• 3 is adjacent to 2

Which Theorem is represented by the map presented?

• Kruskal's Theorem

• Four Color Theorem

• Prim's Theorem

• Coloring is fun!

Which vocabulary term is illustrated through the diagram?

• Minimal Spanning Tree

• Four Color Theorem

• Cycle

• Vertices

The graph is an example of a

• Path

• Cycle

• Complete Bipartite Graph

• Complete Graph

What is the degree of vertex 4?

• 3

• 4

• 5

• 7

Which notation is correct for the complete bipartite graph?

• K_2,3

• K₃

• K₂

• K_{1, 3}