Skip to content
Related Articles

Related Articles

Improve Article

ISRO | ISRO CS 2013 | Question 75

  • Last Updated : 03 May, 2018

The number of edges in a ‘n’ vertex complete graph is ?
(A) n * (n-1) / 2
(B) n * (n+1) / 2
(C) n2
(D) n * (n+1)


Answer: (A)

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

My Personal Notes arrow_drop_up
Recommended Articles
Page :