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
Infinite Hamiltonian paths in Cayley digraphs
β Scribed by Irwin L Jungreis
- Publisher
- Elsevier Science
- Year
- 1985
- Tongue
- English
- Weight
- 942 KB
- Volume
- 54
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
β¦ Synopsis
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 -0o to oo. In this paper, we give conditions on S and H for the existence of one-and two-way infinite Hamiltonian paths in Cay(S:H). Two of our results can be summarized as follows. First, if S is countably infinite and H is abelian, then Cay(S : H) has one-and two-way Hamiltonian paths if and only if it is strongly connected (except for one infinite family). We also give necessary and sufficient conditions on S for Cay(S :H) to be strongly connected for a large class of Cayley digraphs. Second, we show that any Cayley digraph of a countable locally finite group has both one-and two-way infinite Hamiltonian paths. As a lemma, we give a relation between the strong connectivity and the outer valence of finite vertex-transitive digraphs.
π SIMILAR VOLUMES
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
## Abstract Let ${\cal G}$ be a fixed set of digraphs. Given a digraph __H__, a ${\cal G}$βpacking in __H__ is a collection ${\cal P}$ of vertex disjoint subgraphs of __H__, each isomorphic to a member of ${\cal G}$. A ${\cal G}$βpacking ${\cal P}$ is __maximum__ if the number of vertices belonging