Hamilton Circuit Review

Front

What is a Hamilton Circuit?

Back

A Hamilton Circuit is a path in a graph that visits every vertex exactly once and returns to the starting vertex.

Front

In a Hamilton Circuit, we visit:

Back

Every vertex.

Front

How many edges does a complete graph with 4 vertices have?

Back

6.

Front

What is the minimum degree of each vertex in a Hamilton Circuit?

Back

At least 2.

Front

What is a Euler Circuit?

Back

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

Front

In a Euler Circuit, we visit:

Back

Every edge.

Front

How many Hamilton Circuits does a complete graph with 4 vertices have?

Back

6.

Front

What is the difference between a Hamilton Circuit and a Euler Circuit?

Back

A Hamilton Circuit visits every vertex exactly once, while a Euler Circuit visits every edge exactly once.

Front

What is the formula to calculate the number of edges in a complete graph with n vertices?

Back

The formula is n(n-1)/2.

Front

Can a graph have a Hamilton Circuit if it has isolated vertices?

Back

No, a graph with isolated vertices cannot have a Hamilton Circuit.