Complete graph:K4

This article defines a particular undirected graph, i.e., the definition here determines the graph uniquely up to graph isomorphism.
View a complete list of particular undirected graphs

Definition

This graph is defined as the complete graph on a set of size four.

Arithmetic functions

Size measures

Function	Value	Explanation
size of vertex set	4	As $K_{n},n=4$: $n=4$
size of edge set	6	As $K_{n},n=4$: ${\binom {n}{2}}={\binom {4}{2}}=6$