Tree Graphs and Orthogonal Spanning Tree Decompositions
Given a graph G, we construct T(G), called the tree graph of G. The vertices of T(G) are the spanning trees of G, with edges between vertices when their respective spanning trees differ only by a single edge. In this paper we detail many new results concerning tree graphs, involving topics such as c...
| Main Author: | |
|---|---|
| Format: | Others |
| Published: |
PDXScholar
2016
|
| Subjects: | |
| Online Access: | http://pdxscholar.library.pdx.edu/open_access_etds/2944 http://pdxscholar.library.pdx.edu/cgi/viewcontent.cgi?article=3953&context=open_access_etds |