On endo-Cayley digraphs: the Hamiltonian property

DOI10.1016/J.DISC.2004.05.020MaRDI QIDQ2568487zbMATH OpenOpenAlexFDO

Authors Montserrat Maureso, Josep M. Brunat

Publication date 10 October 2005

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2004.05.020

Directed graphs (digraphs), tournaments (05C20) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Eulerian and Hamiltonian graphs (05C45)

Review text

Let \(A\) be a finite abelian group, \(\Delta\subseteq A\), and \(\varphi\) an endomorphism of \(A\). A digraph whose vertices are the elements of \(A\) and whose arcs are the pairs \((x,\varphi(x)+a)\) with \(x\in A\) and \(a\in A\) is called an endo-Cayley digraph. In this paper Hamiltonicity properties of endo-Cayley digraphs are investigated. The main results concern consecutive digraphs, i.e., endo-Cayley digraphs with a finite cyclic group \(A\) as set of vertices and \(\Delta=\{e,e+h,e +2h,\dots\}\). The authors develop a line graph technique which can be applied to find sufficient conditions for Hamiltonicity. Moreover, it is shown that results as the factor group lemma (known for Cayley digraphs on abelian groups) can also be proved for endo-Cayley graphs.

Recommendations

Cites work

Cited in

(3)

This page was built for publication: On endo-Cayley digraphs: the Hamiltonian property

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2568487)