Question 4070 – UGC NET CS 2005 Dec-Paper-2
March 31, 2024Question 4598 – UGC NET CS 2006 June-Paper-2
March 31, 2024Question 4596 – UGC NET CS 2006 June-Paper-2
For a complete graph with N vertices, the total number of spanning trees is given by :
Correct Answer: C
Question 2 Explanation:
If a graph is complete, total number of spanning trees are N N-2
Example:
Formula to find total number of spanning trees are N N-2
=5 5-2
=5 3
=125
Example:
Formula to find total number of spanning trees are N N-2
=5 5-2
=5 3
=125
2N-1
N N-1
N N-2
2N+1
Subscribe
Login
0 Comments