✦ LIBER ✦

Remarks on Hamiltonian properties of powers of digraphs

✍ Scribed by Günter Schaar

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 322 KB
Volume: 51
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(94)90107-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Cayley digraphs of prime-power order are

Cayley digraphs of prime-power order are hamiltonian

✍ Dave Witte 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 400 KB

The Hamiltonian property of consecutive-

The Hamiltonian property of consecutive-d digraphs

✍ D.Z. Du; D.F. Hsu; F.K. Hwang 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 306 KB

Vertex-primitive digraphs of prime-power

Vertex-primitive digraphs of prime-power order are hamiltonian

✍ Ming-Yao Xu 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 158 KB

Witte proved that every connected Cayley digraph of a p-group is hamiltonian. In this note we generalize Witte's result to connected vertex-primitive digraphs of prime-power order; namely, we prove that every connected vertex-primitive digraph of prime-power order is hamiltonian. Witte [6] proved t

The Hamiltonian property of generalized

The Hamiltonian property of generalized de Bruijn digraphs

✍ D.Z Du; D.F Hsu; F.K Hwang; X.M Zhang 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 512 KB

The hamiltonian property of the consecut

The hamiltonian property of the consecutive-3 digraph

✍ G.J. Chang; F.K. Hwang; Li-Da Tong 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 496 KB

On non-Hamiltonian circulant digraphs of

On non-Hamiltonian circulant digraphs of outdegree three

✍ Locke, Stephen C.; Witte, Dave 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 136 KB

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 vert