...
Data-Interpretation
October 28, 2024
Data-Interpretation
October 28, 2024

Minimum-Spanning-Tree

Question 12
The number of spanning trees in a complete graph of 4 vertices labelled A, B, C, and D is _________
A
16
B
C
D
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
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!!