1.

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

Answer»

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