Trees on Data Structure and Algorithms related Questions and Answers


Question :   Consider a complete graph G with 4 vertices. The graph G has ____ spanning trees.
1. 15
2. 8
3. 16
4. 13
Answer :   3 - 16  

* Be the First to Post a Comment.

Submit comment :


Captcha Image
Reload

Ask Question

Captcha Image
Reload

Note : Name and Email never shown.





Subscribe


Become a part of EducationForever. Subscribe to our FREE Newsletter