3.5a Complete Graphs

Complete Graph (Clique)

A complete graph (also called a clique) is a graph, denoted as $K_{|V|}$, in which every pair of distinct vertices is connected by an edge. In such a graph with $|V|$ vertices, each vertex has degree $|V|-1$, and the total number of edges is $|E|=\frac{|V|(|V|-1)}{2}$ (i.e., the maximum number of edges possible in a graph of $|V|$ vertices).