Graph Theory Check

Front

What is the degree of a vertex in a graph?

Back

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

Front

What is a Euler Path?

Back

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

Front

What is a Euler Circuit?

Back

A Euler Circuit is a trail in a graph that visits every edge exactly once and starts and ends at the same vertex.

Front

What is a Hamiltonian Path?

Back

A Hamiltonian Path is a path in a graph that visits every vertex exactly once.

Front

What is a Hamiltonian Circuit?

Back

A Hamiltonian Circuit is a circuit that visits every vertex exactly once and returns to the starting vertex.

Front

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

Back

A graph has a Euler Circuit if all vertices have even degrees.

Front

What does it mean for two vertices to be connected?

Back

Two vertices are connected if there is a path between them.

Front

What is the difference between a path and a circuit in graph theory?

Back

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

Front

What is an odd degree vertex?

Back

An odd degree vertex is a vertex that has an odd number of edges connected to it.

Front

What is an even degree vertex?

Back

An even degree vertex is a vertex that has an even number of edges connected to it.