A

Admin • 832.70K Points
Coach

Q. Consider a complete graph G with 4 vertices. The graph G has spanning trees.

  • (A) 15
  • (B) 8
  • (C) 16
  • (D) 13

Explanation by: Admin

a graph can have many spanning trees. and a complete graph with n vertices has n(n-2) spanning trees. so, the complete graph with 4 vertices has 4(4-2) = 16 spanning trees.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Be the first to start discuss.