On the Tree Graph of a Matroid
Authors:
- Carlos A. HolzmannCHCarlos A. Holzmann
- Frank HararyFHFrank Harary
- 1 March 1972
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Applied Mathematics
- Vol. 22 (2) , 187-193
Abstract
The tree graph $T( G )$ of a connected graph G has the (spanning) trees of G as its points; $t_1 $ and $t_2 $ are adjacent in $T( G )$ if there exist lines x, y of G such that $t_1 - x = t_2 - y$. It has been demonstrated that $T( G )$ is Hamiltonian. Similarly, one can define the “tree graph” $T( M )$ of a matroid M using its bases. It is shown that $T( M )$ is uniformly Hamiltonian in the sense that for each of its lines $\alpha $ there is a Hamiltonian cycle containing $\alpha $ and another, avoiding $\alpha $.
Keywords
This publication has 11 references indexed in Scilit:
- GRAPH THEORY1969
- Matroids versus graphs1969
- On the Realization of Tree GraphsIEEE Transactions on Circuit Theory, 1968
- On Hamilton Circuits in Tree GraphsIEEE Transactions on Circuit Theory, 1968
- A Note on Hamilton Circuits in Tree GraphsIEEE Transactions on Circuit Theory, 1968
- The Existence of a Hamilton Circuit in a Tree GraphIEEE Transactions on Circuit Theory, 1967
- Hamilton Circuits in Tree GraphsIEEE Transactions on Circuit Theory, 1966
- Minimum partition of a matroid into independent subsetsJournal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1965
- Lectures on matroidsJournal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1965
- A THEOREM ON INDEPENDENCE RELATIONSThe Quarterly Journal of Mathematics, 1942