...
TIFR PHD 2022
October 26, 2023
Greedy-approach
October 26, 2023
TIFR PHD 2022
October 26, 2023
Greedy-approach
October 26, 2023

Greedy-approach

Question 15

What is the total number of spanning trees of a complete graph of 4 vertices (K4)?

A
16
B
8
C
4
D
15
Question 15 Explanation: 
To find total number of spanning trees for complete graph using standard formula
nn-2 = 42 = 16
Correct Answer: A
Question 15 Explanation: 
To find total number of spanning trees for complete graph using standard formula
nn-2 = 42 = 16
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!!