A complete graph on n vertices has how many edges?a.nb.n-1c.n(n-1)/2d.2n

A complete graph on n vertices has n(n-1)/2 edges.

Here's why:

In a complete graph, every vertex is connected to every other vertex.

If we have n vertices, then each vertex is connected to n-1 other vertices (since a vertex can't be connected to itself).

However, each edge has been counted twice in this process (once for each of its two vertices), so we need to divide by 2 to get the correct answer.

So, the total number of edges is n(n-1)/2.

Therefore, the correct answer is c. n(n-1)/2.

A complete graph on n vertices has n(n-1)/2 edges. So, the correct answer is c. n(n-1)/2.

Here's why:

In a complete graph, every pair of vertices is connected by an edge. For n vertices, each vertex is connected to n-1 other vertices. So, initially, we might think that the number of edges is n*(n-1).

However, this counts every edge twice (once for each vertex it connects), so we need to divide by 2 to get the correct answer. Hence, the number of edges is n(n-1)/2.