2 2 votes Is there any algorithm to find number of different minimum spanning trees for a graph? Mathematical Logic graph-theory graph-connectivity engineering-mathematics + – raviyogi 825 views answer comment Share Follow Print See all 3 Comments 3 3 Comments reply Rishabh Gupta 2 commented Jan 18, 2018 reply Follow flag Kirchhoff's theorem can be used to count the number of spanning trees: https://en.wikipedia.org/wiki/Kirchhoff%27s_theorem For MSTs: http://wwwmayr.in.tum.de/konferenzen/Jass08/courses/1/pieper/Pieper_Paper.pdf 0 0 replyShare srestha commented Jan 18, 2018 reply Follow flag u can post direct question By permutation, combination we can also find it 0 0 replyShare vishal chugh commented Jan 18, 2018 reply Follow flag @srestha Can you please look at this question https://gateoverflow.in/196493/number-of-minimum-spanning-trees 0 0 replyShare Please log in or register to add a comment.
