Let G be a simple, undirected graph with n (n>10) vertices and k connected…

PYQ UGC NET 2022

Let G be a simple, undirected graph with n (n>10) vertices and k connected components. What is the minimum possible number of edges of G?

  1. A.

    k(n-1)

  2. B.

    n(k-1)

  3. C.

    n+k-2

  4. D.

    n-k

Attempted by 25 students.

Sign up free to check your answer

Sign up free

Explore the full course: Nta Ugc Net Paper 2

Loading lesson…