Question 5351 – Algorithms
November 26, 2023Question 6356 – Algorithms
November 26, 2023UGC NET CS 2008 Dec-Paper-2
| Question 3 |
The total number of spanning trees that can be drawn using five labelled vertices is :
| 125 | |
| 64 | |
| 36 | |
| 16 |
Question 3 Explanation:
To find total number of spanning trees we are using a standard formula is nn-2.
n=5
=55-2
=53
=125
n=5
=55-2
=53
=125
Correct Answer: A
Question 3 Explanation:
To find total number of spanning trees we are using a standard formula is nn-2.
n=5
=55-2
=53
=125
n=5
=55-2
=53
=125
Subscribe
Login
0 Comments