4 votes 4 votes Consider the following adjacency matrix representation of connected graph then find the number of spanning trees are possible for the given graph $\begin{bmatrix} 0&1&1&1&0 \\ 1&0&1&1&0 \\1&1&0&0&1 \\ 1&1&0&0&1 \\0&0&1&1&0 \end{bmatrix}$ Algorithms numerical-answers spanning-tree graph-algorithms + – Rohan Mundhey asked Nov 11, 2016 • retagged Jun 24, 2022 by makhdoom ghaya Rohan Mundhey 1.3k views answer comment Share Follow See 1 comment See all 1 1 comment reply Kantikumar commented Nov 11, 2016 reply Follow Share 24 ? 1 votes 1 votes Please log in or register to add a comment.
Best answer 8 votes 8 votes Here one more loop containing number of edges = 4 which is 1 - 3 - 2 - 4 - 1 ..So this has to be subtracted as well Hence number of spanning trees should be equal to 24 Habibkhan answered Nov 11, 2016 • edited Nov 11, 2016 by Habibkhan Habibkhan comment Share Follow See all 13 Comments See all 13 13 Comments reply Show 10 previous comments Habibkhan commented Nov 11, 2016 reply Follow Share Ya I agree that depends on perspective as well..As Kirchoff's method also involves matrix operations so it will also take time possibly for larger graphs..:) 1 votes 1 votes Arjun commented Nov 11, 2016 reply Follow Share Yes, but always give preference to a method which is less error prone even if a bit more time consuming. 5 votes 5 votes Habibkhan commented Nov 11, 2016 reply Follow Share Ok sir..Agreed..:) 0 votes 0 votes Please log in or register to add a comment.
