Home / Engineering / Theory of Computation / Question

M

Mr. Dubey • 51.17K Points
Coach

Q.) A spanning tree for a simple graph of order 24 has

(A) 12 edges
(B) 6 edges
(C) 23 edges
(D) None of above.
Correct answer : Option (C) - 23 edges

Share

Discusssion

Login to discuss.