Timeline for If graph is tree what can be said about its adjacency matrix ?
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 29, 2015 at 19:18 | review | Late answers | |||
| Sep 30, 2015 at 11:58 | |||||
| Jun 24, 2012 at 22:52 | history | edited | Francesc Font-Clos | CC BY-SA 3.0 |
added 290 characters in body
|
| Jun 24, 2012 at 22:50 | comment | added | Francesc Font-Clos | So, a tree has only one spanning tree (which is itself of course), and conversely, if a graph has only one spanning tree, it must be a tree. Hence using the matrix tree theorem, which as you say counts the number of spanning trees, we can determine if a general graph is a tree or not. | |
| Jun 7, 2012 at 8:49 | comment | added | Felix Goldberg | What is the connection? The matrix-tree theorem counts spanning trees in a general graph. The OP asked something about trees (or bipartite graphs). | |
| Jun 1, 2012 at 22:36 | history | answered | Francesc Font-Clos | CC BY-SA 3.0 |