Complete graphs
7.2
The complete graph on n vertices, denoted by Kn, is the simple
graph that contains exactly one edge between each pair of distinct
vertices.
K1
K2
K3
K4
K5
Previous slide
Next slide
Back to first slide
View graphic version