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

  1. A.

    (n − 1)(n − 2)/2 edges

  2. B.

    more than (n – 1) (n – 2)/2 edges

  3. C.

    less than (n – 1) (n – 2)/2 edges

  4. D.

    ∑i=1k C(ni, 2) edges

Attempted by 220 students.

Sign up free to check your answer

Sign up free

Explore the full course: Nta Ugc Net Paper 2

Loading lesson…