Friday, 29 May 2015

Q37,Paper2,J13. Which of the following connected simple graph has exactly one spanning tree ?



(A) Complete graph
(B) Hamiltonian graph
(C) Euler graph
(D) None of the above

Answer D.
Posted by at

No comments:

Post a Comment

Note: only a member of this blog may post a comment.

Subscribe to: Post Comments (Atom)