ISRO | ISRO CS 2013 | Question 75
The number of edges in a ‘n’ vertex complete graph is ?
(A) n * (n-1) / 2
(B) n * (n+1) / 2
(D) n * (n+1)
Explanation: Complete graph is an undirected graph in which each vertex is connected to every vertex, other than itself. If there are ‘n’ vertices then total edges in a complete graph is n(n-1)/2
Quiz of this Question