Discrete Math Graphs

Front

What is a circuit in graph theory?

Back

A circuit is a path that starts and ends at the same vertex.

Front

What is a minimal spanning tree (MST)?

Back

A minimal spanning tree is a subset of edges that connects all vertices in a graph with the minimum total edge weight.

Front

How can you determine if a graph has a Euler's Path?

Back

A graph has a Euler's Path if it has exactly 2 vertices of odd degree.

Front

What is a path in graph theory?

Back

A path is a sequence of edges that connects a sequence of vertices without repeating any vertex.

Front

What is Kruskal’s algorithm used for?

Back

Kruskal’s algorithm is used to find the minimum spanning tree of a graph.

Front

What is the difference between a path and a circuit?

Back

A path does not return to the starting vertex, while a circuit does.

Front

What does it mean for a graph to be connected?

Back

A graph is connected if there is a path between every pair of vertices.

Front

What is the degree of a vertex?

Back

The degree of a vertex is the number of edges incident to it.

Front

What is an edge in graph theory?

Back

An edge is a connection between two vertices in a graph.

Front

What is a weighted graph?

Back

A weighted graph is a graph where edges have weights (or costs) associated with them.