Home /permanent

Complete Graph

Complete Graph is a Simple Graph where every pair of vertices is adjacent (linked by an Edge).

The complete graph with n vertices is written $. It has these properties:

  • Every vertex has degree -1$.
  • The sum of the degree sequence is (n-1)$.
  • The number of edges is n(n−1)2\frac{n(n-1)}{2}.

A single vertex on its own is also a complete graph. See Week 13 - Graphs A.