Contact Style About

1 marks
Q.No : 27
Q.27. Let G be a connected graph
with n vertices & m edges. To
find spanning tree T from

By Josie

1 marks
Q.No : 27
Q.27. Let G be a connected graph
with n vertices & m edges. To
find spanning tree T from G we
have to remove m-(n-1) number
of edges from G.
A. TRUE
B. FALSE​

About the author
Josie

An electric kettle rated at 220V , 2.2kW , works for 3 hrs . find the energy consumed and the current drawn.

Hii frien

A train can accommodate at most 80 passengers, economy class (x) and firstclass (y) passengers. To avoid making a loss the train m

1 thought on “1 marks<br />Q.No : 27<br />Q.27. Let G be a connected graph<br />with n vertices & m edges. To<br />find spanning tree T from”

Leave a Comment