Open Access
Translator Disclaimer
2008 Paths and circuits in $\mathbb{G}$-graphs
Christa Bauer, Chrissy Johnson, Alys Rodriguez, Bobby Temple, Jennifer Daniel
Involve 1(2): 135-144 (2008). DOI: 10.2140/involve.2008.1.135

Abstract

For a group G with generating set S={s1,s2,,sk}, the G-graph of G, denoted Γ(G,S), is the graph whose vertices are distinct cosets of si in G. 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 Γ(G,S).

Citation

Download 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

Received: 4 February 2008; Revised: 9 April 2008; Accepted: 2 June 2008; Published: 2008
First available in Project Euclid: 20 December 2017

zbMATH: 1146.05306
MathSciNet: MR2429654
Digital Object Identifier: 10.2140/involve.2008.1.135

Subjects:
Primary: 05C25 , 20F05

Keywords: generators , Graphs , groups

Rights: Copyright © 2008 Mathematical Sciences Publishers

JOURNAL ARTICLE
10 PAGES


SHARE
Vol.1 • No. 2 • 2008
MSP
Back to Top