A complete graph on $n$ nodes, denoted by $K_n$, is a graph whose edges connect every node to every other node. $K_{12}$ is shown in the figure below.
Page:
Context:
