𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The hamiltonian numbers in digraphs

✍ Scribed by Ting-Pang Chang, Li-Da Tong

Book ID
120694175
Publisher
Springer US
Year
2012
Tongue
English
Weight
343 KB
Volume
25
Category
Article
ISSN
1382-6905

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The consecutive-4 digraphs are Hamiltoni
The consecutive-4 digraphs are Hamiltonian
✍ Chang, Gerard J.; Hwang, Frank K.; Tong, Li-Da πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 192 KB

Du, Hsu, and Hwang conjectured that consecutive-d digraphs are Hamiltonian for d = 3, 4. Recently, we gave an infinite class of consecutive-3 digraphs

Infinite Hamiltonian paths in Cayley dig
Infinite Hamiltonian paths in Cayley digraphs
✍ Irwin L Jungreis πŸ“‚ Article πŸ“… 1985 πŸ› Elsevier Science 🌐 English βš– 942 KB

Let Cay(S : H) be the Cayley digraph of the generators S in the group H. A one-way infinite Hamiltonian path in the digraph G is a listing of all the vertices [q: 1 ~< i <oo], such that there is an arc from vi to vi+ 1. A two-way infinite Hamiltonian path is similarly defined, with i ranging from -0