On the structure of Hamiltonian cycles in Cayley graphs of finite quotients of the modular group
β Scribed by Paul E. Schupp
- Publisher
- Elsevier Science
- Year
- 1998
- Tongue
- English
- Weight
- 994 KB
- Volume
- 204
- Category
- Article
- ISSN
- 0304-3975
No coin nor oath required. For personal study only.
β¦ Synopsis
It is a fairly longstanding conjecture that if G is any finite group with IG/ > 2 and if X is any set of generators of G then the Cayley graph T(G : X) should have a Hamiltonian cycle. We present experimental results found by computer calculation that support the conjecture. It turns out that in the case where G is a finite quotient of the modular group the Hamiltonian cycles possess remarkable structural properties.
π SIMILAR VOLUMES
Let G be a finite group, S a subset of G=f1g; and let Cay Γ°G; SΓ denote the Cayley digraph of G with respect to S: If, for any subset T of G=f1g; CayΓ°G; SΓ ffi CayΓ°G; T Γ implies that S a ΒΌ T for some a 2 AutΓ°GΓ; then S is called a CI-subset. The group G is called a CIM-group if for any minimal gene
The Hamilton cycles of a graph generate a subspace of the cycle space called the Hamilton space. The Hamilton space of any connected Cayley graph on an abelian group is determined in this paper.
A digraph with n vertices and fixed outdegree m is generated randomly so that each such digraph is equally likely to be chosen. We consider the probability of the existence of a Hamiltonian cycle in the graph obtained by ignoring arc orientation. We show that there exists m (~23) such that a Hamilto
In this paper a short proof is given of a theorem of M . Gromov in a particular case using a combinatorial argument .