What are the maximum number of spanning trees (Tₙ) possible for a complete…

PYQ RPSC Programmer 2024

What are the maximum number of spanning trees (Tₙ) possible for a complete graph K₅ on 5 vertices?

  1. A.

    100

  2. B.

    20

  3. C.

    200

  4. D.

    125

  5. E.

    Question not attempted

Attempted by 485 students.

Sign up free to check your answer

Sign up free

Explore the full course: Rpsc Programmer

Loading lesson…