A graph in which each vertex is connected to every other vertex is called a complete graph.
Note that degree of each vertex will be n−1, where n is the order of graph.
Number of edges in a complete graph is n(n−1)/2.
A complete graph of order n is denoted by Kn.
Examples of Complete Graph
K4 Complete Graph
K5 Complete graph
K6 Complete graph
K7 Complete graph
K8 Complete graph
