1.

Prove that is the maximum number of edges in a simple graph with n vertices.

Answer»

ong>Answer:

The MAXIMUM number of edges possible in a single graph with 'N' vertices is NC2 where nC2 = n(n – 1)/2. The number of simple GRAPHS possible with 'n' vertices = 2nc2 = 2n(n-1)/2.



Discussion

No Comment Found

Related InterviewSolutions