A simple graph G with n-vertices is connected if the graph has
A. (n – 1) (n – 2)/2 edges
B. more than (n – 1) (n – 2)/2 edges
C. less than (n – 1) (n – 2)/2 edges
D. Σki=1 C(ni, 2) edges
Answer:B
A simple graph G with n-vertices is connected if the graph has
A. (n – 1) (n – 2)/2 edges B. more than (n – 1) (n – 2)/2 edges C. less than (n – 1) (n – 2)/2 edges D. Σki=1 C(ni, 2) edges