1. Consider the complete graph with 5 vertices, denoted by K5.

E.) Does K5 contain Hamiltonian circuits? If yes, draw them.

I know that a Hamiltonian circuit is a graph cycle through a graph that visits each node exactly once. However, the trivial graph on a single node is considered to possess a Hamiltonian cycle, but the connected graph on two nodes is not. A graph possessing a Hamiltonian circuit is said to be a Hamiltonian graph.

Is it correct that K5 doesn't contain Hamiltonian circuits because this is a connected graph on two nodes?

2. I have never done anything related with Graph Theory but with a google search for your problem I found this pdf, where it states that the number of Hamilton circuits in K(n) is
(n-1)! [factorial]

3. It does not have two nodes, but five nodes. Any complete graph with more than two vertices has a Hamiltonian cycle: just go around the graph in order.

Consider the complete graph with 5 vertices, denoted by K5.

Does K5 contain Hamiltonian circuits? If yes, draw them.

Is it correct to say that K5 does contain Hamiltonian circuits because it has more than two vertices?

5. Originally Posted by Joystar1977
Is it correct to say that K5 does contain Hamiltonian circuits because it has more than two vertices?
Well, having more than two vertices is not sufficient, by itself, to ensure that any particular graph contains a Hamiltonian circuit. It is necessary. However, because $K_{5}$, in addition to having more than two vertices, contains an edge from any vertex to any other vertex, it is quite straight-forward to construct a Hamiltonian circuit.

#### Posting Permissions

• You may not post new threads
• You may not post replies
• You may not post attachments
• You may not edit your posts
•