Posted by
**Joy** on
.

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

A. Draw the graph.

B. How many edges are in K5? How many edges are in Kn?

C. Find an isomorphic representation (graph) of K5. Give the isomorphism mappings.

D. Does K5 contain Eulerian circuits? (why?) If yes, draw them.

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

F. How many walks of length 2 are there in graph K5? Explain.