edited by
850 views
2 votes
2 votes

Is there any short trick to do it ?

edited by

1 Answer

Best answer
1 votes
1 votes
Observe the given graph(rectangular+traingle+hexagon)

Spanning tree contains no cycles. & connects all vertices.

for rectangular area=> select 3 out of 5 edges & remove 2 traingular cycle = 5c3-2 = 8

for traingular area=> select 2 out of 3 edges = 3c2 = 3

for hexagonal area=> select 5 out of 7 edges & remove cycles(formed by 4 edges with any 1 edge out of remaining 3 edges) = 7c5-2(3c1) = 21-6 = 15.

so, total possible spanning tree = 8*3*15= 360.
selected by

Related questions

3 votes
3 votes
1 answer
3
1 votes
1 votes
1 answer
4
Prince Sindhiya asked Nov 19, 2018
450 views
is there any easy way to do this i did it by making equation,Mn+Ec=Vn, Vc+In=Vn