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

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

2006-09-30

arxiv.org/abs/math/0610010v1

Mathematics

Combinatorics

11 pages, no figures

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Hamiltonian cycles in (2,3,c)-circulant digraphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Hamiltonian cycles in (2,3,c)-circulant digraphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Hamiltonian cycles in (2,3,c)-circulant digraphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-616390