Complete Graph
# Definition
A Complete Graph is an Undirected Graph $(V, E)$ s.t. $E = {{v, w} : v,w \in V, v \neq w}$. We denote it $K_{V}$. If $V$ is taken to be $[n]$ for some $n \in \mathbb{N}$, then we just denote it $K_{n}$.
Search
A Complete Graph is an Undirected Graph $(V, E)$ s.t. $E = {{v, w} : v,w \in V, v \neq w}$. We denote it $K_{V}$. If $V$ is taken to be $[n]$ for some $n \in \mathbb{N}$, then we just denote it $K_{n}$.