in Algorithms retagged by
325 views
0 votes
0 votes

Determine the number of the spanning treess in the following graph ???

in Algorithms retagged by
325 views

1 comment

At each spanning tree the edges $(0-a),(0-b),(0-c),(0-d)$ is there. there are $4$ similar structures on different sides.

lets take graph having nodes $(c,7,8,9)$. from this, we can form $7$ different spanning trees. in the same way we find others.
0
0

Please log in or register to answer this question.