Flows in circulant graphs of odd order are sums of Hamilton cycles (Q583084): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claim: author (P16): Item:Q923101 |
||
Property / author | |||
Property / author: Q213774 / rank | |||
Revision as of 16:24, 21 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Flows in circulant graphs of odd order are sums of Hamilton cycles |
scientific article |
Statements
Flows in circulant graphs of odd order are sums of Hamilton cycles (English)
0 references
1989
0 references
It can be shown that, in a connected circulant graph of odd order, Hamiltonian cycles span the cycle space. In the present paper, it is shown that any flow in such a graph can be expressed as a sum of Hamiltonian cycles. This result is valid not only for flows in circulant graphs, but also for flows in any Cayley graph on any finite abelian group of odd order except for flows in the Cartesian product graph of two cycles of length 3.
0 references
circulant graph
0 references
Hamiltonian cycles
0 references
flow
0 references