Hamilton cycles in circulant digraphs with prescribed number of distinct jumps |
| |
Authors: | Zbigniew R. Bogdanowicz |
| |
Affiliation: | Armament Research, Development and Engineering Center, Picatinny, NJ 07806, USA |
| |
Abstract: | Let G be a digraph that consists of a finite set of vertices V(G). G is called a circulant digraph if its automorphism group contains a |V(G)|-cycle. A circulant digraph G has arcs incident to each vertex i, where integers aks satisfy 0<a1<a2<aj≤|V(G)|−1 and are called jumps. It is well known that not every G is Hamiltonian. In this paper we give sufficient conditions for a G to have a Hamilton cycle with prescribed distinct jumps, and prove that such conditions are also necessary for every G with two distinct jumps. Finally, we derive several results for obtaining G′ with k, k≥2 distinct jumps if the corresponding G contains a Hamilton cycle with two distinct jumps. |
| |
Keywords: | Hamilton cycles Circulants Digraph Hamilton circuits |
本文献已被 ScienceDirect 等数据库收录! |
|