On Hamiltonian Property of Cayley Digraphs
摘要
Let G be a finite group generated by S and C(G, S) the Cayley digraphs of G with connection set S. In this paper, we give some sufficient conditions for the existence of hamiltonian circuit in C(G, S), where G = Zm ⋊ H is a semiproduct of Zm by a subgroup H of G. In particular, if m is a prime, then the Cayley digraph of G has a hamiltonian circuit unless G = Zm × H. In addition, we introduce a new digraph operation, called φ-semiproduct of Γ1 by Γ2 and denoted by Γ1 ⋊φ Γ2, in terms of mapping φ: V(Γ2) → {1, −1}. Furthermore we prove that C(Zm, {a}) ⋊φC(H, S) is also a Cayley digraph if φ is a homomorphism from H to