TIFR PHD 2022
October 26, 2023Greedy-approach
October 26, 2023Greedy-approach
|
Question 15
|
What is the total number of spanning trees of a complete graph of 4 vertices (K4)?
|
16
|
|
|
8
|
|
|
4
|
|
|
15
|
Question 15 Explanation:
To find total number of spanning trees for complete graph using standard formula
nn-2 = 42 = 16
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
nn-2 = 42 = 16