Hamiltonian decompositions of Cayley graphs on abelian groups of odd order (Q1907112): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1006/jctb.1996.0007 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W4212896073 / rank | |||
Normal rank |
Latest revision as of 23:48, 19 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Hamiltonian decompositions of Cayley graphs on abelian groups of odd order |
scientific article |
Statements
Hamiltonian decompositions of Cayley graphs on abelian groups of odd order (English)
0 references
28 April 1996
0 references
The reviewer has posed the problem [Research Problem 59, Discrete Math. 50, 115 (1984)] of whether or not every connected Cayley graph on a finite abelian group has a Hamiltonian decomposition, that is, a partition of the edge set into Hamilton cycles. The Cayley graph \(X(G; S)\) on the finite abelian group \(G\) with symbol \(S\) is the graph whose vertices are labelled by the elements of \(G\) with an edge joining \(x\) and \(y\) if and only if either \(x- y\) or \(y- x\) belongs to \(S\). With this definition, it is assumed that \(s\in S\) and \(\text{ord}(s)\neq 2\) imply \(s^{-1}\not\in S\). The author proves that a Cayley graph \(X(G; S)\) on an odd order abelian group \(G\) has a Hamilton decomposition whenever \(S\) is a minimal generating set of \(G\).
0 references
Cayley graph
0 references
abelian group
0 references
Hamiltonian decomposition
0 references