What is the largest integer m such that every simple connected graph with n…

PYQ GATE 2007

What is the largest integer m such that every simple connected graph with n vertices and n edges contains at least m different spanning trees?

  1. A.

    1

  2. B.

    2

  3. C.

    3

  4. D.

    n

Attempted by 189 students.

Sign up free to check your answer

Sign up free

Explore the full course: Zero To Hero

Loading lesson…