Hamiltonian cycles in (2,3,c)-circulant digraphs
| dc.creator | Morris, Dave Witte | |
| dc.creator | Morris, Joy | |
| dc.creator | Webb, Kerri | |
| dc.date | 2006-09-30 | |
| dc.date.accessioned | 2026-07-07T07:28:31Z | |
| dc.date.available | 2026-07-07T07:28:31Z | |
| dc.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. | |
| dc.description | 11 pages, no figures | |
| dc.identifier | https://arxiv.org/abs/math/0610010 | |
| dc.identifier | http://arxiv.org/abs/math/0610010 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/117760 | |
| dc.subject | Combinatorics | |
| dc.subject | 05C45; 05C20, 05C25 | |
| dc.title | Hamiltonian cycles in (2,3,c)-circulant digraphs | |
| dc.type | text |