arXiv:1103.5293 Abstract | arXiv Analytics

arXiv:1103.5293 [math.CO]Abstract References Reviews Resources

2-generated Cayley digraphs on nilpotent groups have hamiltonian paths

Published 2011-03-28, updated 2011-06-30Version 3

Suppose G is a nilpotent, finite group. We show that if {a,b} is any 2-element generating set of G, then the corresponding Cayley digraph Cay(G;a,b) has a hamiltonian path. This implies there is a hamiltonian path in every connected Cayley graph on G that has valence at most 4.

Comments: 7 pages, no figures; corrected a few typographical errors

Categories: math.CO

Subjects: 05C25, 05C45, 05C20

Keywords: hamiltonian path, nilpotent groups, corresponding cayley digraph cay, connected cayley graph, finite group

Related articles: Most relevant | Search more

arXiv:1306.5443 [math.CO] (Published 2013-06-23)

On Cayley digraphs that do not have hamiltonian paths

Dave Witte Morris

arXiv:1111.6216 [math.CO] (Published 2011-11-27)

Cayley graphs on nilpotent groups with cyclic commutator subgroup are hamiltonian

Ebrahim Ghaderpour, Dave Witte Morris

arXiv:1911.02763 [math.CO] (Published 2019-11-07)