On the Tree Graph of a Matroid

Authors:
  • CHCarlos A. Holzmann
    Carlos A. Holzmann
  • FHFrank Harary
    Frank Harary

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 $.

This publication has 11 references indexed in Scilit: