Hamiltonian Cycles in Cayley Graphs of Semidirect Products of Finite Groups
Abstract
It has been conjectured that every connected Cayley graph of order greater than 2 has a Hamilton cycle. In this paper, we prove that the Cayley graph of (Zp?Zp)? Zq with respect to a generating set S, Cay((Zp?Zp)? Zq, S), where S ={s,t} with |s|=p and |t|=q is Hamiltonian for p,q > 3. Furthermore, the existence of a Hamilton cycle in the Cayley graph of a semidirect product of finite groups is proved by placing restrictions on the generating sets. Consequently, the existence of a Hamilton cycle in the Cayley graphs of several isomorphism types of groups of orders pnq, p2q2 and p2qr, where n ? 2 is also proved.
Key words: Cayley graph, connected and bridgeless, finite groups, Hamilton cycle, perfect matching, semidirect product, standard generating set.
Downloads
Published
Issue
Section
License
Terms and conditions of Creative Commons Attribution 4.0 International License apply to all published manuscripts. This Journal is licensed under a Creative Commons Attribution 4.0 International License. This licence allows authors to use all articles, data sets, graphics and appendices in data mining applications, search engines, web sites, blogs and other platforms by providing appropriate reference. The journal allows the author(s) to hold the copyright without restrictions and will retain publishing rights without restrictions.
A competing interest exists when professional judgment concerning the validity of research is influenced by a secondary interest, such as financial gain. We require that our authors reveal all possible conflicts of interest in their submitted manuscripts.
The Editor reserves the right to shorten and adjust texts. Significant changes in the text will be agreed with the Authors.