Name
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@?{(n/2)+2,(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. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1016/j.disc.2009.01.001 | Discrete Mathematics |
Keywords | Field | DocType |
circulant,directed graph,hamiltonian cycle | Discrete mathematics,Combinatorics,Vertex (geometry),Hamiltonian (quantum mechanics),Hamiltonian path,Directed graph,Circulant matrix,Mathematics,Digraph | Journal |
Volume | Issue | ISSN |
309 | 17 | Discrete Mathematics |
Citations | PageRank | References |
1 | 0.36 | 1 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Dave Witte Morris | 1 | 20 | 5.42 |
| Joy Morris | 2 | 78 | 16.06 |
| Kerri Webb | 3 | 8 | 1.58 |