78 research outputs found
Hamiltonian decompositions of Cayley graphs on abelian groups of even order
AbstractAlspach conjectured that any 2k-regular connected Cayley graph cay(A,S) on a finite abelian group A can be decomposed into k hamiltonian cycles. In 1992, the author proved that the conjecture holds if S={s1,s2,…,sk} is a minimal generating set of an abelian group A of odd order. Here we prove an analogous result for abelian group of even order: If A is a finite abelian group of even order at least 4 and S={s1,s2,…,sk} is a strongly minimal generating set (i.e., 2si∉〈S−{si}〉 for each 1⩽i⩽k) of A, then cay(A,S) can be decomposed into hamiltonian cycles
Hamilton decompositions of 6-regular abelian Cayley graphs
In 1969, Lovasz asked whether every connected, vertex-transitive graph has a Hamilton path. This question has generated a considerable amount of interest, yet remains vastly open. To date, there exist no known connected, vertex-transitive graph that does not possess a Hamilton path. For the Cayley graphs, a subclass of vertex-transitive graphs, the following conjecture was made:
Weak Lovász Conjecture: Every nontrivial, finite, connected Cayley graph is hamiltonian.
The Chen-Quimpo Theorem proves that Cayley graphs on abelian groups flourish with Hamilton cycles, thus prompting Alspach to make the following conjecture:
Alspach Conjecture: Every 2k-regular, connected Cayley graph on a finite abelian group has a Hamilton decomposition.
Alspach’s conjecture is true for k = 1 and 2, but even the case k = 3 is still open. It is this case that this thesis addresses.
Chapters 1–3 give introductory material and past work on the conjecture. Chapter 3 investigates the relationship between 6-regular Cayley graphs and associated quotient graphs. A proof of Alspach’s conjecture is given for the odd order case when k = 3. Chapter 4 provides a proof of the conjecture for even order graphs with 3-element connection sets that have an element generating a subgroup of index 2, and having a linear dependency among the other generators.
Chapter 5 shows that if Γ = Cay(A, {s1, s2, s3}) is a connected, 6-regular, abelian Cayley graph of even order, and for some1 ≤ i ≤ 3, Δi = Cay(A/(si), {sj1 , sj2}) is 4-regular, and Δi ≄ Cay(ℤ3, {1, 1}), then Γ has a Hamilton decomposition. Alternatively stated, if Γ = Cay(A, S) is a connected, 6-regular, abelian Cayley graph of even order, then Γ has a Hamilton decomposition if S has no involutions, and for some s ∈ S, Cay(A/(s), S) is 4-regular, and of order at least 4.
Finally, the Appendices give computational data resulting from C and MAGMA programs used to generate Hamilton decompositions of certain non-isomorphic Cayley graphs on low order abelian groups
On Hamilton decompositions of infinite circulant graphs
The natural infinite analogue of a (finite) Hamilton cycle is a two-way-infinite Hamilton path (connected spanning 2-valent subgraph).
Although it is known that every connected 2k-valent infinite circulant graph has a two-way-infinite Hamilton path, there exist many such graphs that do not have a decomposition into k edge-disjoint two-way-infinite Hamilton paths. This contrasts with the finite case where it is conjectured that every 2k-valent connected circulant graph has a decomposition into k edge-disjoint Hamilton cycles. We settle the problem of decomposing 2k-valent infinite circulant graphs into k edge-disjoint two-way-infinite Hamilton paths for k=2, in many cases when k=3, and in many other cases including where the connection set is ±{1,2,...,k} or ±{1,2,...,k - 1, 1,2,...,k + 1}
Hamilton Decompositions of Certain 6-regular Cayley Graphs on Abelian Groups with a Cyclic Subgroup of Index Two
Alspach conjectured that every connected Cayley graph of even valency on a finite Abelian group is Hamilton-decomposable. Using some techniques of Liu, this article shows that if A is an Abelian group of even order with a generating set {a,b}, and A contains a subgroup of index two, generated by c, then the 6-regular Cayley graph is Hamilton-decomposable
Chirality from quantum walks without quantum coin
Quantum walks (QWs) describe the evolution of quantum systems on graphs. An
intrinsic degree of freedom---called the coin and represented by a
finite-dimensional Hilbert space---is associated to each node. Scalar quantum
walks are QWs with a one-dimensional coin. We propose a general strategy
allowing one to construct scalar QWs on a broad variety of graphs, which admit
embedding in Eulidean spaces, thus having a direct geometric interpretation.
After reviewing the technique that allows one to regroup cells of nodes into
new nodes, transforming finite spatial blocks into internal degrees of freedom,
we prove that no QW with a two-dimensional coin can be derived from an
isotropic scalar QW in this way. Finally we show that the Weyl and Dirac QWs
can be derived from scalar QWs in spaces of dimension up to three, via our
construction.Comment: 22 pages, 2 figure
Cayley graphs of order 6pq are Hamiltonian
Assume G is a finite group, such that |G| is either 6pq or 7pq, where p and q are distinct prime numbers, and let S be a generating set of G. We prove there is a Hamiltonian cycle in the corresponding Cayley graph on G with connecting set S
- …