A complete graph is a graph where each pair of vertices is connected by an edge. It is also called a full graph. As every vertex has a direct connection with all the other vertices, it is an example of a Hamiltonian graph.
A complete graph is a graph where each pair of vertices is connected by an edge. It is also called a full graph. As every vertex has a direct connection with all the other vertices, it is an example of a Hamiltonian graph.