On endo-Cayley digraphs: The hamiltonian property Original Research Article

Given a finite abelian group A, a subset image and an endomorphism image of A, the endo-Cayley digraph image is defined by taking A as the vertex set and making every vertex x adjacent to the vertices image with image. When A is cyclic and the set image is of the form image, the digraph G is called a consecutive digraph. In this paper we study the hamiltonicity of endo-Cayley digraphs by using three approaches based on: line digraph, merging cycles and a generalization of the factor group lemma. The results are applied to consecutive digraphs.