Graph Theory review

Front

What is a loop in graph theory?

Back

An edge that begins and ends at the same vertex.

Front

What is an Euler Path?

Back

A trail in a graph that visits every edge exactly once.

Front

What is an Euler Circuit?

Back

A circuit that visits every edge exactly once and returns to the starting vertex.

Front

What is the degree of a vertex?

Back

The number of edges incident to the vertex.

Front

What does it mean for a graph to have an Euler Path?

Back

It means that there exists a trail that visits every edge exactly once.

Front

What is the condition for a graph to have an Euler Circuit?

Back

All vertices must have even degree.

Front

What are adjacent vertices?

Back

Vertices that are connected by an edge.

Front

How do you calculate the weight of a circuit in a weighted graph?

Back

By summing the weights of all edges in the circuit.

Front

What is a weighted graph?

Back

A graph in which each edge has a numerical value (weight) associated with it.

Front

What is the significance of the degree of a vertex in graph theory?

Back

It helps determine the connectivity and structure of the graph.