A simple graph G with n-vertices is connected if the graph has
PYQ UGC NET 2013
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.
∑i=1k C(ni, 2) edges
Attempted by 220 students.
Sign up free to check your answer
Sign up freeLoading lesson…

