Data-Interpretation
October 28, 2024Minimum-Spanning-Tree
Question 12 |
The number of spanning trees in a complete graph of 4 vertices labelled A, B, C, and D is _________
16 | |
| |
| |
|
Question 12 Explanation:
Number of spanning trees in a complete graph of n vertices are n(n-2) =4(4-2) =16
Correct Answer: A
Question 12 Explanation:
Number of spanning trees in a complete graph of n vertices are n(n-2) =4(4-2) =16
Subscribe
Login
0 Comments