Graph Theory Test Review (Vocab)

Front

What is a bridge in graph theory?

Back

A bridge is an edge in a graph whose removal increases the number of connected components.

Front

Identify the characteristics of a complete graph.

Back

In a complete graph, every pair of distinct vertices is connected by a unique edge.

Front

What is a Euler Circuit?

Back

A Euler Circuit is a trail in a graph that visits every edge exactly once and returns to the starting vertex.

Front

What defines a simple graph?

Back

A simple graph is a graph that does not have loops or multiple edges between the same pair of vertices.

Front

What is a cycle in graph theory?

Back

A cycle is a path in a graph that starts and ends at the same vertex without repeating any edges or vertices.

Front

Explain what an isolated vertex is.

Back

An isolated vertex is a vertex that has no edges connecting it to any other vertex in the graph.

Front

What is the difference between a path and a cycle?

Back

A path is a sequence of edges connecting distinct vertices, while a cycle returns to the starting vertex.

Front

Define a wheel graph.

Back

A wheel graph is a graph that consists of a cycle with an additional vertex connected to all vertices of the cycle.

Front

What is the significance of connected components in a graph?

Back

Connected components are subsets of a graph where there is a path between any two vertices in the subset.

Front

What does it mean for a graph to be planar?

Back

A graph is planar if it can be drawn on a plane without any edges crossing.