Name
Abstract | ||
|---|---|---|
Given a finite abelian group A, a subset @[email protected]?A and an endomorphism @f of A, the endo-Cayley digraph G"A(@f,@D) is defined by taking A as the vertex set and making every vertex x adjacent to the vertices @f(x)+a with [email protected][email protected] When A is cyclic and the set @D is of the form @D={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. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1016/j.disc.2004.05.020 | Discrete Mathematics |
Keywords | Field | DocType |
line digraph,endo-circulant digraph,c -circulant digraph,endo-cayley digraph,consecutive digraph,c-circulant digraph,hamiltonian digraph | Discrete mathematics,Abelian group,Circulant graph,Combinatorics,Vertex (geometry),Hamiltonian path,Cayley graph,Finite group,Digraph,Mathematics,Endomorphism | Journal |
Volume | Issue | ISSN |
299 | 1-3 | Discrete Mathematics |
Citations | PageRank | References |
0 | 0.34 | 9 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Montserrat Maureso | 1 | 1 | 1.38 |
| Josep M. Brunat | 2 | 42 | 5.52 |