How many edges are in K15, the complete graph with 15 vertices.
Any help would be appreciated, thanks.
13
To find the number of edges in a complete graph with n vertices, you can use the formula:
Number of edges = n * (n - 1) / 2
In the case of K15, the complete graph with 15 vertices, we can substitute n = 15 into the formula:
Number of edges = 15 * (15 - 1) / 2
Number of edges = 15 * 14 / 2
Number of edges = 210 / 2
Number of edges = 105
Therefore, there are 105 edges in the complete graph K15.
To find the number of edges in a complete graph with n vertices, you can use the formula:
Number of edges = (n * (n - 1)) / 2
For K15, which is a complete graph with 15 vertices, you can substitute n = 15 into the formula:
Number of edges = (15 * (15 - 1)) / 2
Simplifying this expression:
Number of edges = (15 * 14) / 2
Number of edges = 210 / 2
Number of edges = 105
Therefore, K15, the complete graph with 15 vertices, has 105 edges.
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.