Mathematica 9 is now available
Student Support Forum
-----
Student Support Forum: 'about spanning trees' topicStudent Support Forum > General > Archives > "about spanning trees"

Next Comment >Help | Reply To Topic
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: ,

Subject (listing for 'about spanning trees')
Author Date Posted
about spanning trees Pagolmon 01/14/10 6:23pm
Re: about spanning trees yehuda ben-s... 01/20/10 08:40am
Re: Re: about spanning trees Pagolmon 01/23/10 04:06am
Re: about spanning trees toen 01/21/10 01:37am
Re: Re: about spanning trees Pagolmon 01/23/10 04:29am
Re: about spanning trees tomd 02/18/10 06:01am
Next Comment >Help | Reply To Topic