Graph Theory Quiz

What is a directed edge represented as?

• {u, v}

• (v, u)

• (u, v)

• {u, u}

Which type of graph consists of a set of vertices and edges with no loops or multiple edges?

• Pseudograph

• Directed Graph

• Multigraph

• Simple Graph

What is the degree of a vertex with no incident edges called?

• Pendant Vertex

• Isolated Vertex

• Cut Vertex

• Leaf Vertex

Which theorem states that a simple graph with n vertices and every vertex having a degree of at least n/2 has a Hamilton circuit?

• Dirac's Theorem

• Ore's Theorem

• Euler's Theorem

• Planar Graph Theorem

What is the minimum number of edges whose removal disconnects a graph called?

• Vertex Connectivity

• Bridge

• Edge Connectivity

• Graph Cut

What type of graph is defined as having a unique simple path between any two vertices?

• Bipartite Graph

• Complete Graph

• Tree

• Cyclic Graph

In a bipartite graph, how can the vertex set be partitioned?

• Into equal subsets

• Into three subsets

• Into two disjoint sets

• Into overlapping sets

What is the chromatic number of a planar graph according to the Four Color Theorem?

• 4

• 1

• 2

• 3

Which of the following graphs contains an Euler circuit?

• A graph with all vertices of even degree

• A graph with exactly two vertices of odd degree

• A disconnected graph

• A complete graph with odd vertices

What is the representation of a graph that lists all edges called?

• Edge List

• Incidence Matrix

• Adjacency List

• Adjacency Matrix