Hamiltonian cycles in (2,3,c)-circulant digraphs

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.
11 pages, no figures

Keywords

Combinatorics, 05C45; 05C20, 05C25

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/117760

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/0610010
 http://arxiv.org/abs/math/0610010

Collections

arXiv