Cayley digraphs of prime-power order are hamiltonian (Q762490)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Cayley digraphs of prime-power order are hamiltonian |
scientific article |
Statements
Cayley digraphs of prime-power order are hamiltonian (English)
0 references
1986
0 references
Let \(S\) generate a finite group \(G\). The Cayley digraph \(\text{Cay}(S:G)\) of the generators \(S\) on \(G\) is a directed graph, defined as follows. The vertices of \(\text{Cay}(S:G)\) are the elements of \(G\), and there is an arc from \(g\) to \(gs\) whenever \(g\in G\) and \(s\in S\). We prove that if the number of elements in \(G\) is a prime-power, then there is a Hamiltonian circuit in \(\text{Cay}(S:G)\), for every generating set \(S\).
0 references
Cayley graph
0 references
Hamiltonian cycle
0 references
Cayley digraph
0 references
Hamiltonian circuit
0 references