✦ LIBER ✦

Enumeration of hamiltonian paths in Cayley diagrams

✍ Scribed by David Housman

Publisher: Springer
Year: 1981
Tongue: English
Weight: 952 KB
Volume: 23
Category: Article
ISSN: 0001-9054
DOI: 10.1007/bf02188014

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Hamiltonian paths in Cayley digraphs of

Hamiltonian paths in Cayley digraphs of finitely-generated infinite abelian groups

✍ Douglas Jungreis 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 983 KB

We show every finitely-generated, infinite abeliar\_ group (i.e. Zn x G where G is a finite abelian group) has a minimal generating set for which the Cayley digraph has a two-way in&rite hamiltonian path, and if n 2 2, then this Cayley digraph also has a one-way infinite hamiltonian path. We show fu

Hamiltonian cycles and paths in Cayley g

Hamiltonian cycles and paths in Cayley graphs and digraphs — A survey

✍ Stephen J. Curran; Joseph A. Gallian 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 927 KB

Cayley graphs arise naturally in computer science, in the study of word-hyperbolic groups and automatic groups, in change-ringing, in creating Escher-like repeating patterns in the hyperbolic plane, and in combinatorial designs. Moreover, Babai has shown that all graphs can be realized as an induced

Hamilton paths in Cayley diagraphs of me

Hamilton paths in Cayley diagraphs of metacyclic groups

✍ Stephen J. Curran 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 480 KB

We obtain a characterization of all Hamilton paths in the Cayley digraph of a metacyclic group G with generating set {x, y} where (yx-') a G. The abundance of these Hamilton paths allows us to show that Hamilton paths occur in groups of at least two.

Powers of Hamiltonian paths in interval

Powers of Hamiltonian paths in interval graphs

✍ Isaak, Garth 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 232 KB 👁 3 views

We give a simple proof that the obvious necessary conditions for a graph to contain the k th power of a Hamiltonian path are sufficient for the class of interval graphs. The proof is based on showing that a greedy algorithm tests for the existence of Hamiltonian path powers in interval graphs. We wi

Construction of all Hamiltonian paths in

Construction of all Hamiltonian paths in tournaments

✍ V. Ya. Burdyuk; A. A. Kakhichko; V. V. Shcherbak 📂 Article 📅 1978 🏛 Springer US 🌐 English ⚖ 376 KB