Mathematics – Combinatorics
Scientific paper
1997-02-04
Mathematics
Combinatorics
Scientific paper
We construct infinitely many connected, circulant digraphs of outdegree
three that have no hamiltonian circuit. All of our examples have an even
number of vertices, and our examples are of two types: either every vertex in
the digraph is adjacent to two diametrically opposite vertices, or every
vertex is adjacent to the vertex diametrically opposite to itself.
Locke Stephen C.
Witte Dave
No associations
LandOfFree
On non-Hamiltonian circulant digraphs of outdegree three 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 On non-Hamiltonian circulant digraphs of outdegree three, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On non-Hamiltonian circulant digraphs of outdegree three will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-671871