Abstract
Given a finite abelian group A, a subset Δ ⊆ A and an endomorphism φ of A, the endo-Cayley digraph G A ( φ , Δ ) is defined by taking A as the vertex set and making every vertex x adjacent to the vertices φ ( x ) + a with a ∈ Δ . When A is cyclic and the set Δ is of the form Δ = { e , e + h , … , e + ( d - 1 ) h } , 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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
