Infinitely many nonsolvable groups whose Cayley graphs are hamiltonian

Journal of Algebra Combinatorics Discrete Structures and Applications

article

Dave Witte Morris¹ 

[1] Department of Mathematics and Computer Science, University of Lethbridge

关键词: Cayley graph;    Hamiltonian cycle;    Solvable group;    Alternating group;   

DOI  :  10.13069/jacodesmath.66457

学科分类：社会科学、人文和艺术（综合）

来源: Yildiz Technical University

【 摘 要 】

We show there are infinitely many finite groups G, such that every connected Cayley graph on G hasa hamiltonian cycle, and G is not solvable. Specifically, we show that if A5 is the alternating groupon five letters, and p is any prime, such that p ≡ 1 (mod 30), then every connected Cayley graph onthe direct product A5 × Zp has a hamiltonian cycle.

【 授权许可】

CC BY