Discussion
Given a complete graph G with 5 vertices, then the graph G has how many spanning trees :
Answer: B
The complete graph on 5 vertices has 125 spanning trees.
By Cayley's formula, the complete graph \(K_{n}\) has \(n^{n-2}\) spanning trees:
\[ 5^{5-2} = 5^{3} = 125 \]
25 is \(5^{2}\), which uses the wrong exponent, and 225 and 325 do not come from the formula at all.
No comment is present. Be the first to comment.
Loading…
Post your comment
Please log in or register to post a comment.
Examination Categories
- SSC Exams
- Banking Exams
- Teaching Exams
- Civil Services Exams
- Railways Exams
- Engineering Recruitment Exams
- Defence Exams
- State Government Exams
- Police Exams
- Insurance Exams
- Nursing Exams
- Other Government Exams
- NRA CET
- PG Entrance Exams
- Campus Placement
- MBA Entrance Exams
- CUET and UG Entrance
- Judiciary Exams
- Regulatory Body Exams
- Software Development