Kn has n(n-1)/2 edges
Think on it. Each of the n vertices connects to n-1 others. But by the time you've connected all n vertices, you made 2 connections for each.
How many edges are in K15, the complete graph with 15 vertices.
Any help would be appreciated, thanks.
2 answers
13