Abstract
For a group with generating set , the -graph of , denoted , is the graph whose vertices are distinct cosets of in . Two distinct vertices are joined by an edge when the set intersection of the cosets is nonempty. In this paper, we study the existence of Hamiltonian and Eulerian paths and circuits in .
Citation
Christa Bauer. Chrissy Johnson. Alys Rodriguez. Bobby Temple. Jennifer Daniel. "Paths and circuits in $\mathbb{G}$-graphs." Involve 1 (2) 135 - 144, 2008. https://doi.org/10.2140/involve.2008.1.135
Information