|E(Kₙ)| = n(n − 1) / 2Variables
- n
- number of vertices
- E
- edge set
Reference details
- Subject
- Discrete Math
- Topic
- graphs
- Plain text
|E(K_n)|=n(n-1)/2
Discrete Math · graphs
Counts edges in a complete graph on n vertices.
|E(Kₙ)| = n(n − 1) / 2|E(K_n)|=n(n-1)/2