1.

The maximum number of edges in a n-node undirected graph without self loops is(A) n2(B) n * (n-1)/2(C) n – 1(D) (n + 1) * n/2

Answer»


Discussion

No Comment Found

Related InterviewSolutions