in Algorithms edited by
540 views
1 vote
1 vote

in Algorithms edited by
540 views

4 Comments

@Gupta731 is there any limitation in kirchoff theorem ?

0
0
Kirchoffs algorithm can be applied to unweighted graphs, not in weighted graphs.
0
0
okk thanks
0
0

1 Answer

4 votes
4 votes
Best answer
Out of the three $2$ weight edges we have to take atleast $2$. Now, $ABE$ are connected.

Now if we select $BC=3$, then we have only $2$ options either $ED$ or $DC$.

If we don't select $BC$ then we can take any $2$ of $ED,EC\,or\,DC$

So total number of spanning trees $={}^3C_{2}*(2 + {}^3C_2)=15$
selected by

Related questions