1.

Consider an undirected graph G with 100 nodes. The maximum number of edges to be included in G so that the graph is not connected is

A. 2451
B. 4950
C. 4851
D. 9900
Answer» D. 9900


Discussion

No Comment Found