Question 5351 – Algorithms
November 26, 2023
Question 6356 – Algorithms
November 26, 2023
Question 5351 – Algorithms
November 26, 2023
Question 6356 – Algorithms
November 26, 2023

UGC NET CS 2008 Dec-Paper-2

Question 3
The total number of spanning trees that can be drawn using five labelled vertices is :
A
125
B
64
C
36
D
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
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
0 0 votes
Article Rating
Subscribe
Notify of
0 Comments
Inline Feedbacks
View all comments
0
Would love your thoughts, please comment.x
()
x
error: Alert: Content selection is disabled!!