Hamiltonian cycles in (2,3,c)-circulant digraphs
Combinatorics
2007-05-23 v1
Abstract
Let D be the circulant digraph with n vertices and connection set {2,3,c}. (Assume D is loopless and has outdegree 3.) Work of S.C.Locke and D.Witte implies that if n is a multiple of 6, c is either (n/2) + 2 or (n/2) + 3, and c is even, then D does not have a hamiltonian cycle. For all other cases, we construct a hamiltonian cycle in D.
Keywords
Cite
@article{arxiv.math/0610010,
title = {Hamiltonian cycles in (2,3,c)-circulant digraphs},
author = {Dave Witte Morris and Joy Morris and Kerri Webb},
journal= {arXiv preprint arXiv:math/0610010},
year = {2007}
}
Comments
11 pages, no figures