Question 61
How many total edges exist in a Complete Undirected Graph with 'n' vertices?
In a complete undirected graph, every pair of distinct vertices is connected by an edge, giving n C 2 = n(n - 1) / 2 total edges. Each vertex is connected to n-1 other vertices, giving n(n-1) degree sum; every undirected edge contributes 2 to the degree sum, so $E=n(n-1)/2$.