| Author |
Comment/Response |
Pagolmon
|
 01/14/10 6:23pm
Hi,
I have an undirected graph with 7 vertices and 10 edges. I calculated using NumberOfSpanningTrees function that it has total 69 spanning trees. Also confirmed this number with Kirchhoff's matrix tree theorem. Now my question is, is there any way/idea about how to get all the spanning trees?
Thanks in advance.
Attachment: Graph.jpg, URL: , |
|
