Question

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​

Answer 1

Answer:

true

Step-by-step explanation:

cl goo to go go go go CO du du