Cayley graphs on groups with commutator subgroup of order 2p are hamiltonian
Dave Witte Morris

TL;DR
This paper proves that for finite groups with a specific commutator subgroup order, all connected Cayley graphs on these groups contain Hamiltonian cycles, expanding understanding of Hamiltonian properties in algebraic graph theory.
Contribution
It establishes that all connected Cayley graphs on groups with a commutator subgroup of order 2p (p odd prime) are Hamiltonian, a new result in algebraic graph theory.
Findings
All connected Cayley graphs on such groups are Hamiltonian.
The result applies to groups with commutator subgroup order 2p, p odd prime.
This advances the classification of Hamiltonian Cayley graphs.
Abstract
We show that if G is a finite group whose commutator subgroup [G,G] has order 2p, where p is an odd prime, then every connected Cayley graph on G has a hamiltonian cycle.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFinite Group Theory Research · graph theory and CDMA systems · Coding theory and cryptography
Abstract
We show that if is a finite group whose commutator subgroup has order , where is an odd prime, then every connected Cayley graph on has a hamiltonian cycle.
keywords:
Cayley graph, hamiltonian cycle, commutator subgroup
**Cayley graphs on groups with commutator
subgroup of order are hamiltonian**
\authordata
Dave Witte Morris Department of Mathematics and Computer Science, University of Lethbridge,
Lethbridge, Alberta, T1K 3M4, Canada [email protected], http://people.uleth.ca/$\sim$dave.morris/
\msc
05C25, 05C45
1 Introduction
Let be a finite group. It is easy to show that if is abelian (and ), then every connected Cayley graph on has a hamiltonian cycle. (See 2.1 for the definition of the term Cayley graph.) To generalize this observation, one can try to prove the same conclusion for groups that are close to being abelian. Since a group is abelian precisely when its commutator subgroup is trivial, it is therefore natural to try to find a hamiltonian cycle when the commutator subgroup of is close to being trivial. The following theorem, which was proved in a series of papers, is a well-known result along these lines.
Theorem 1.1** (Marušič [14], Durnberger [5, 6], 1983–1985).**
If the commutator subgroup of has prime order, then every connected Cayley graph on has a hamiltonian cycle.
D. Marušič (personal communication) suggested more than thirty years ago that it should be possible to replace the prime with a product of two distinct primes:
Research Problem 1.2** (D. Marušič, personal communication, 1985).**
Show that if the commutator subgroup of has order , where and are two distinct primes, then every connected Cayley graph on has a hamiltonian cycle.
This has recently been accomplished when is either nilpotent [9] or of odd order [15]. As another step toward the solution of this problem, we establish the special case where :
Theorem 1.3**.**
If the commutator subgroup of has order , where is an odd prime, then every connected Cayley graph on has a hamiltonian cycle.
See the bibliography of [13] for references to other results on hamiltonian cycles in Cayley graphs.
The proof of theorem 1.3 is a lengthy case-by-case analysis, based on the choice of certain elements and of the Cayley graph’s connection set (see notation 3.3). Here is an outline of the paper:
- 1 Introduction
- 2 Some known results
- 3 Assumptions, group theory, and connected sums
- 4 Case with
- 5 Cases with and
- 6 Cases with
- 7 Cases with and
- 8 Cases with and
- 9 Cases with and
- References
- A Notes to aid the referee
2 Some known results
We recall a few results that provide hamiltonian cycles in various Cayley graphs.
Definition 2.1** (cf. [10, p. 34]).**
For any subset of a finite group , is the graph whose vertex set is , with an edge joining to , for each and . This is called the Cayley graph of the connection set on the group .
Remark 2.2**.**
Unlike most authors (including [10]), we do not require the connection set to be symmetric in the definition of a Cayley graph; that is, we do not assume is closed under inverses. This does not change the set of graphs that are considered to be Cayley graphs, because, in our notation, , where .
Theorem 2.3** ([13, 4, 7, 8]).**
Every connected Cayley graph on has a hamiltonian cycle if for some prime and some with and .
Notation 2.4**.**
- •
The symbol always represents a finite group.
- •
For and , we use to denote the walk in that visits (in order), the vertices
[TABLE]
We may write for .
- •
We use to denote the concatenation of copies of the sequence .
- •
Appending to a sequence deletes the last term; that is, .
- •
If is a walk in , and , we use to denote the translate .
- •
When is an oriented cycle, we use to denote the same cycle as , but with the opposite orientation.
- •
For :
[TABLE]
- •
We use to denote the commutator subgroup of .
- •
For convenience, we let .
- •
For , we let be the image of in .
- •
We use to denote the center of .
Definition 2.5** (cf. [11, §2.1.3, p. 61]).**
Suppose
- •
is an abelian, normal subgroup of , and
- •
is an (oriented) cycle in .
The voltage of is . This is an element of , and it may be denoted .
We have the following straightforward observations:
Lemma 2.6**.**
*Assume the notation of 2.5. Then: ††margin:
[note A.1] *
* is determined by the oriented cycle : it is independent of the choice of the vertex of , and of the choice of the representative of .* 2. 2.
* for all .* 3. 3.
.
Definition 2.7**.**
A subset of is an irredundant generating set of if generates , but no proper subset of generates .
Lemma 2.8** (“Factor Group Lemma” [17, §2.2]).**
Suppose
- •
* is a cyclic, normal subgroup of ,*
- •
* is a hamiltonian cycle in , and*
- •
the voltage generates .
Then is a hamiltonian cycle in .
Corollary 2.9** ([13, Cor. 2.11]).**
Suppose
- •
* is a normal subgroup of , such that is prime,*
- •
the image of in is an irredundant generating set of ,
- •
there is a hamiltonian cycle in , and
- •
* for some with .*
Then there is a hamiltonian cycle in .
Lemma 2.10** ([3, Lem. 1 on p. 24]).**
Let be the Cartesian product of a path of length with a path of length . If is even, and , then has a hamiltonian path from any corner vertex to any vertex that is at odd distance from .
Corollary 2.11**.**
Suppose is a subgroup of an abelian group , and is a subset of that generates . Let and . If is even, , , , and is odd, then has a hamiltonian path , such that .
**Proof. **If we identify the vertices of with in the natural way, then the map is an isomorphism from to a subgraph of \operatorname{Cay}\bigl{(}\langle x,y\rangle;x,y\bigr{)}. So lemma 2.10 provides a hamiltonian path in from to . So .
Let be a hamiltonian path in \operatorname{Cay}\bigl{(}H/\langle x,y,N\rangle\bigr{)}, and let
[TABLE]
From the definition of and , we see that the natural map from to \operatorname{Cay}\bigl{(}\langle x,y,N\rangle/N;x,y\bigr{)} is an isomorphism onto a spanning subgraph. Therefore, is a hamiltonian path in . Since is abelian, it is easy to see that .††margin:
[note A.2]
∎
Given a hamiltonian cycle in , the following result often provides a second hamiltonian cycle , such that the voltage of at least one of these two cycles generates . (Then lemma 2.8 provides a hamiltonian cycle in .)
Lemma 2.12** (cf. Marušič [14] and Durnberger [5], or see [15, Lem. 3.1]).**
Assume:
- •
* is an abelian normal subgroup of , such that is abelian,*
- •
* is an oriented hamiltonian cycle in ,*
- •
* and ,*
- •
* contains:*
the oriented path , and
either the oriented edge or the oriented edge .
*Then there is a hamiltonian cycle in , such that ††margin:
[note A.3] *
[TABLE]
Furthermore, and have exactly the same oriented edges, except for some of the edges in the subgraph induced by .
Lemma 2.13** ([5, Lem. 2.8]).**
Assume
- •
* is an irredundant generating set of ,*
- •
, with ,
- •
* commutes with ,*
- •
, and
- •
there is a hamiltonian cycle in \operatorname{Cay}\bigl{(}\langle S\smallsetminus\{s\}\rangle;S\smallsetminus\{s\}\bigr{)}.
Then there is a hamiltonian cycle in .
We do not need the general theory of nilpotent groups, but we will make use of the following two facts. (The first is essentially the definition of a nilpotent group, which can be found in any graduate-level textbook on group theory.)
Lemma 2.14** ([16, (iii) on p. 175 and Prop. VI.1.h on page 176]).**
Every abelian group is nilpotent. 2. 2.
If is nilpotent, then is nilpotent.
Therefore, if (in other words, if is abelian), then is nilpotent.
Theorem 2.15** ([9]).**
If is a nontrivial, nilpotent, finite group, and the commutator subgroup of is cyclic, then every connected Cayley graph on has a hamiltonian cycle.
The following observation is well known (and easy to prove).
Lemma 2.16** ([13, Lem. 2.27]).**
Let generate a finite group and let , such that . If
- •
\operatorname{Cay}\bigl{(}G/\langle s\rangle;S\bigr{)}* has a hamiltonian cycle, and*
- •
either
, or 2. 2.
, or 3. 3.
* is prime,*
then has a hamiltonian cycle.
Corollary 2.17**.**
Suppose
- •
* is cyclic of order , where and are distinct primes,*
- •
* is an irredundant generating set of , and*
- •
some nontrivial element of is in .
Then has a hamiltonian cycle.
**Proof. **We may assume . Since every subgroup of a cyclic, normal subgroup is also normal, we know that . Also, there are hamiltonian cycles in , , and (by theorem 1.1 and the elementary fact that Cayley graphs on abelian groups have hamiltonian cycles). Hence, we may assume and (perhaps after interchanging and ), for otherwise lemma 2.16 applies.
Let . We may assume , for otherwise so theorem 2.3 applies. Then, since is nilpotent (see lemma 2.14) and its commutator subgroup is , the proof in [12, §4] implies there is a hamiltonian cycle in \operatorname{Cay}\bigl{(}\widehat{G}/\widehat{G}^{\prime};S^{\prime}) whose voltage††margin:
[note A.4]
generates . Then, since , the proof of lemma 2.16(2) in [13, Lem. 2.27(2)] tells us that is a hamiltonian cycle in \operatorname{Cay}\bigl{(}G/\mathbb{Z}_{q};S\bigr{)}.
Note that, since is a nilpotent group whose commutator subgroup is in the center and has prime order , the order of must be a multiple of ; that is, is a multiple of (cf. lemma 3.6 below).††margin:
[note A.5] Calculating modulo , we have
[TABLE]
Therefore generates . So lemma 2.8 tells us that \bigl{(}(t_{i},s^{p-1})_{i=1}^{n}\bigr{)}{}^{q} is a hamiltonian cycle in . ∎
3 Assumptions, group theory, and connected sums
Assumptions 3.1**.**
The remainder of this paper provides a proof of theorem 1.3, so
- •
is an odd prime,
- •
is a finite group whose commutator subgroup has order , and
- •
is an irredundant generating set of .††margin:
[note A.6]
We wish to show that the Cayley graph has a hamiltonian cycle.
3A Basic group theory
Assumption 3.2**.**
Because of corollary 2.17, we may assume .
Notation 3.3**.**
The assumption that the commutator subgroup has order implies that is cyclic (cf. [15, §2E, proof of Cor. 1.4]), so we may write
[TABLE]
From theorem 2.15, we may assume is not nilpotent, so (see lemma 2.14). This implies . ††margin:
[note A.7]
Hence there exists , such that
[TABLE]
Then there exists , such that ††margin:
[note A.8]
[TABLE]
The assumptions (3.3A) and (3.3B) are the basis of most of the arguments in the later sections of the paper.
For ease of reference, we now collect a few well-known facts from group theory (specialized to our setting).
Lemma 3.4**.**
If , such that , then .
**Proof. **Since , we have
[TABLE]
Therefore
[TABLE]
Corollary 3.5**.**
Suppose is a proper subset of , such that . (In particular, this will be the case if .) Then .
**Proof. **Suppose . This means . Since and , this implies . So lemma 3.4 tells us that . This contradicts the fact that the generating set is irredundant. ∎
Lemma 3.6**.**
*Let be a group.††margin:
[note A.9]
If , and centralizes , then . Therefore for all .*
Corollary 3.7**.**
*If , such that centralizes , and , then is divisible by .††margin:
[note A.10] *
Corollary 3.8**.**
*Let , such that . If , such that , then is even.††margin:
[note A.11] *
In particular, if , then, by taking , we see that is even, so is even (and, similarly, must also be even).
Corollary 3.9**.**
* is divisible by .*
3B Connected sums
Definition 3.10** ([9, Defn. 5.1]).**
Assume and are two vertex-disjoint oriented cycles in , and let , and . If
- •
contains the oriented edge , and
- •
contains the oriented edge ,
then we use to denote the oriented cycle obtained from by
- •
removing the oriented edges and , and ††margin:
[note A.12]
- •
inserting the oriented edges and .
This is called the connected sum of and .
If is any oriented edge of an oriented cycle , and , such that is vertex disjoint from , then we can form the connected sum . This construction can be iterated:
Definition 3.11**.**
Suppose
- •
are oriented edges of an oriented cycle in , such that for all , and
- •
, such that the cycles , , , …, are pairwise vertex-disjoint.
Then we can form the connected sum
[TABLE]
We call this a connected sum of signed translates of .
Lemma 3.12** (cf. [9, Lem. 5.2]).**
If , , , , and are as in 3.10, then
[TABLE]
**Proof. **We may assume (or, in other words, ), after translating the cycles by (cf. lemma 2.6(2)). Write and , so
[TABLE]
By assumption, contains the edge and contains the edge , so and . Therefore
[TABLE]
Corollary 3.13**.**
Assume that , , , , and are as in 3.10. If is another oriented cycle that is vertex-disjoint from and contains the oriented edge , then
[TABLE]
Corollary 3.14** ([9, Lem. 5.2]).**
If , , , , and are as in 3.10, then
[TABLE]
The following result describes a fairly common situation in which the connected sum provides hamiltonian cycles in :
Lemma 3.15**.**
Let be a nonempty subset of , , , and . Assume and are oriented hamiltonian cycles in \operatorname{Cay}\bigl{(}\langle\overline{S_{0}}\rangle;S_{0}\bigr{)}, such that
- •
* is a nontrivial element of ,*
- •
* and both contain the oriented edge ,*
- •
for every , contains at least two edges that are labelled either or ,
- •
, and
- •
either or .
If either
there exists , such that , or 2. 2.
* is even,*
then there is a hamiltonian cycle in , such that , so lemma 2.8 yields a hamiltonian cycle in .
**Proof. **Let . We have , so corollary 3.5 implies .
Suppose . By assumption, this implies , which means that and both contain the oriented edge . Then the translate contains the oriented edge . The connected sums and are hamiltonian cycles in . From corollary 3.14, we have
[TABLE]
so projects nontrivially to . Corollary 3.13 says , which generates (because it is conjugate to the inverse of , which is assumed to be a nontrivial element of ). Therefore, we see that either or generates , as desired. So we may assume henceforth that .
We now show that we may assume . To this end, suppose it is not the case that . Let . Then, by choosing a sequence of oriented edges of , we can form a connected sum of signed translates of :
[TABLE]
This is a hamiltonian cycle in \operatorname{Cay}\bigl{(}\langle\overline{S_{0}},\overline{t}\rangle;S_{0}\cup\{t\}\bigr{)}. We may assume . Then another hamiltonian cycle can be constructed by replacing the leftmost occurrence of with , and lemma 3.12 tells us that , which is a nontrivial element of (and is conjugate to the inverse of this). From the definition of connected sum, it is obvious that contains at least two edges labelled . So the hamiltonian cycles and satisfy the hypotheses of the lemma with in the role of and with in the role of .††margin:
[note A.13]
*Case 1 . Assume there exists , such that . *
*Subcase 1.1 . Assume . * Fix a hamiltonian path in with , and let . Any connected sum is a hamiltonian cycle in .
Since and do not have the same projection to , the voltages of and do not have the same projection to . Therefore, by choosing to be the appropriate element of , we may assume the projection of to is nontrivial (see corollary 3.14). Note also that if , then we must have .††margin:
[note A.14]
We may assume that , and that the connected sum is relative to the oriented edge of that is also in .††margin:
[note A.15]
Therefore, another hamiltonian cycle can be constructed by replacing with in the connected sum. Then lemma 3.12 (together with lemma 2.6(2)) implies that is conjugate to , which is a generator of . Therefore, either or generates , as desired.
*Subcase 1.2 . Assume . * Let , let , let be a hamiltonian path in \operatorname{Cay}\bigl{(}\overline{G}/\langle\overline{S_{u}}\rangle;S\smallsetminus S_{u}\bigr{)} with , and let . (Since is an irredundant generating set for , we have .) Any connected sum
[TABLE]
is a hamiltonian cycle in \operatorname{Cay}\bigl{(}\langle\overline{S_{u}}\rangle;S_{u}\bigr{)}, so any connected sum
[TABLE]
is a hamiltonian cycle in .
Since , we know that contains more than one edge labeled , so has an edge labeled that was not removed in the construction of the connected sum . Furthermore, the definition of the connected sum implies that also contains an edge labeled . Therefore, we may form connected sums
[TABLE]
without removing any of the edges of . Since and do not have the same projection to , the voltages of these two connected sums do not have the same projection to (see corollary 3.14). Therefore, by choosing to be the appropriate element of , we may assume the projection of to is nontrivial.
We have
[TABLE]
so the proof can be completed almost exactly as in the final paragraph of lemma 3.15 (by constructing another connected sum in which is replaced with ).
*Case 2 . Assume projects nontrivially to , for every . * In particular, projects nontrivially to , for every d\in S\smallsetminus\bigl{(}S_{0}\cup\{c\}\bigr{)}. Since we may assume that lemma 3.15 does not apply with in the place of , we conclude that we may assume††margin:
[note A.16]
[TABLE]
Choose a hamiltonian path in . Any connected sum
[TABLE]
is a hamiltonian cycle in . Calculating modulo , and letting be the nontrivial element of , we have
[TABLE]
The proof is now completed exactly as in the final paragraph of lemma 3.15. ∎
Corollary 3.16**.**
Let , , and . Assume and are oriented hamiltonian cycles in \operatorname{Cay}\bigl{(}\langle\overline{S_{0}}\rangle;S_{0}\bigr{)}, such that
- •
* is a nontrivial element of ,*
- •
* and both contain the oriented edge ,*
- •
for every , contains at least two edges that are labelled either or , and
- •
.
Then there is a hamiltonian cycle in , such that , so lemma 2.8 yields a hamiltonian cycle in .
**Proof. **We may assume , for all and . (Otherwise, we see from corollary 3.8 that lemma 3.15(2) applies.) Choose , such that , let , and let . Any connected sum of the following form is a hamiltonian cycle in \operatorname{Cay}\bigl{(}\langle S_{0}^{+}\rangle;S_{0}^{+}\bigr{)}:
[TABLE]
We may assume , and that the connected sum is formed by using the oriented edge that is also in . Therefore, a second hamiltonian cycle can be constructed by replacing the leftmost occurrence of with . Then corollary 3.8 implies that lemma 3.15(2) applies (with , , , , and in the roles of , , , , and , respectively). ∎
4 Case with
Case 4.1**.**
Assume there exist with and .
**Proof. **Write with . We may assume , for otherwise is prime, so corollary 2.9 applies with . Note that the irredundance of implies and do not contain . This implies that every element of centralizes .††margin:
[note A.17]
So and do not centralize .††margin:
[note A.18]
Let and .
**Subcase 4.1.1 . ***Assume .
Since is abelian, it is easy to find a hamiltonian cycle in \operatorname{Cay}\bigl{(}\overline{G};S\smallsetminus\{s\}\bigr{)}, such that .††margin:
[note A.19] Since , and , we must have .*
For each subset of , we define to be the hamiltonian cycle constructed from by changing to for all . The proof is completed by noting that may be chosen such that generates , so lemma 2.8 applies:
- •
If , let .
- •
If is the nontrivial element of , and does not invert , then we may let .
- •
If is the nontrivial element of , and inverts , then is even, so we must have . We may let .
**Subcase 4.1.2 . ***Assume .
(Since does not centralize , this implies that inverts .) Choose a hamiltonian cycle in \operatorname{Cay}\bigl{(}\overline{G}/\langle\overline{t}\rangle;S\smallsetminus\{s,t\}\bigr{)}, and let*
[TABLE]
Since is even (see corollary 3.9) and is an irredundant generating set††margin:
[note A.20] of , it is easy to see that is a hamiltonian cycle in \operatorname{Cay}\bigl{(}\overline{G};S\smallsetminus\{s\}\bigr{)}.††margin:
[note A.21] Note that whenever is odd, and that (because ).††margin:
[note A.22]
We may assume (for otherwise , so theorem 2.3 applies). We construct a hamiltonian cycle from :
- •
If , construct by changing to .
- •
If , construct by changing both and to .
In each case, generates . (To see this in the second case, note that centralizes , because inverts , and each centralizes .) Therefore, lemma 2.8 applies. ∎
5 Cases with and
Recall that the elements and of satisfy (3.3A) and (3.3B).
Case 5.1**.**
Assume , , and there exists , such that . (It may be the case that .)
**Proof. **Let and . Since (and is abelian), it is easy to find a hamiltonian cycle in \operatorname{Cay}\bigl{(}\overline{G}/\langle\overline{a}\rangle;S\smallsetminus\{a\}\bigr{)}, such that , and for some . Since , we know and are both even (see corollary 3.8). Since is even, we have the following (well-known) hamiltonian cycle in :††margin:
[note A.23]
[TABLE]
Letting , we have , so ††margin:
[note A.24]
(because is even). Therefore
[TABLE]
so, calculating modulo , we have
[TABLE]
which is nontrivial (mod ).
Recall that . Let and . Then contains both the oriented edge and the oriented path . So lemma 2.12 (with , , and ) provides a hamiltonian cycle , such that is conjugate to . Since centralizes , but not , this voltage is a generator of .††margin:
[note A.25]
Thus, either or generates , so lemma 2.8 provides a hamiltonian cycle in . ∎
Case 5.2**.**
Assume , , and there does not exist , such that .
**Proof. **Choose with . Let
[TABLE]
By assumption, we know . Also, we may assume (after interchanging and if necessary). Then corollary 3.5 tells us . Furthermore, we see from corollary 3.8 that the image of in has even order,††margin:
[note A.26]
so is even.
**Subcase 5.2.1 . *** Assume .
It is not difficult to construct a hamiltonian cycle in \operatorname{Cay}\bigl{(}\langle\overline{S}\smallsetminus\{\overline{d}\}\rangle/\langle\overline{a}\rangle;\overline{S}\smallsetminus\{\overline{a},\overline{d}\}\bigr{)}, such that and ††margin:
[note A.27]
for some . Then, since is even, we may define as in (5.1A), so is a hamiltonian cycle in \operatorname{Cay}\bigl{(}\langle\overline{S}\smallsetminus\{\overline{d}\}\rangle;S\smallsetminus\{d\}\bigr{)}.*
Let , and note that contains the oriented edges and . Since , but , we see from lemma 3.12 that there is a connected sum
[TABLE]
with , such that . Note that is a hamiltonian cycle in .
The cycle contains both and , and neither of these paths contains either the edge or the edge . Therefore, also contains both of these paths, so lemma 2.12 (with , , , and ) provides a hamiltonian cycle in , such that \bigl{(}\mathop{\Pi}C\bigr{)}^{-1}\bigl{(}\mathop{\Pi}C^{\prime}\bigr{)} is a conjugate of , which is a generator of (since centralizes , but not ). Then either or generates , so lemma 2.8 applies.
**Subcase 5.2.2 . *** Assume and .
Since (and ), we have , so corollary 3.5 implies . (Therefore , which means .) We have the following hamiltonian cycle in \operatorname{Cay}\bigl{(}\langle\overline{a},\overline{b}\rangle;\overline{a},\overline{b}\,\bigr{)}:*
[TABLE]
Using the oriented edge , we can form the connected sum . Then, since contains both and , we can extend this to a connected sum
[TABLE]
with , such that (see corollary 3.14). Since contains both and , we may argue as in the last paragraph of case 5.2. Namely, lemma 2.12 (with , , , and ) provides a hamiltonian cycle in , such that \bigl{(}\mathop{\Pi}C\bigr{)}^{-1}\bigl{(}\mathop{\Pi}C^{\prime}\bigr{)} is a conjugate of , which is a generator of . Then either or generates , so lemma 2.8 applies.
**Subcase 5.2.3 . ***Assume .
As in LABEL:{noc+n=2+r>2}, we must have and (so ).*
**Subsubcase 5.2.3.1 . ***Assume .
Since (by an assumption of this case), we have . We have the following hamiltonian cycle in :††margin:
[note A.28] *
[TABLE]
Since is central in (by an assumption of this case), we know that
[TABLE]
so .
Note that contains both and (because ), so applying lemma 2.12 (with , , and ) yields a hamiltonian cycle in , such that \bigl{(}\mathop{\Pi}C_{0}\bigr{)}^{-1}\bigl{(}\mathop{\Pi}C_{1}\bigr{)} is a conjugate of , which is a generator of . Then either or generates , so lemma 2.8 applies.
**Subsubcase 5.2.3.2 . *** Assume and does not centralize .
Since the walk is a hamiltonian path in \operatorname{Cay}\bigl{(}\langle\overline{a},\overline{b}\rangle;a,b\bigr{)}, we have the following hamiltonian cycle in :*
[TABLE]
Note that
[TABLE]
Since does not invert , we know that .††margin:
[note A.29]
Therefore, since does not centralize , we may assume ††margin:
[note A.30]
(by replacing with its inverse if necessary). Also, since is central modulo , we have . Therefore, generates , so lemma 2.8 applies.
**Subsubcase 5.2.3.3 . ***Assume and centralizes .
Suppose . Let and . From theorem 1.1, we know there is a hamiltonian cycle in \operatorname{Cay}(\widehat{H};a,b\bigr{)}. Deleting an edge labeled (and passing to the reverse and/or a translate if necessary) yields a hamiltonian path in \operatorname{Cay}(\widehat{H};a,b\bigr{)} from to . Let*
[TABLE]
Then
[TABLE]
because is in the center of . Since , this calculation implies that is a closed walk in . So is a hamiltonian cycle in . The calculation also implies that lemma 2.8 applies, because .
We may now assume . Therefore, since centralizes , and , we see from lemma 3.6 that does not centralize .††margin:
[note A.31]
Also, we may assume , for otherwise lemma 2.13 applies with and . However, we know (by an assumption of this case). Therefore . So case 5.2 applies after interchanging and . ∎
6 Cases with
Case 6.1**.**
Assume and does not invert .
**Proof. **Let . We may assume (perhaps after replacing with its inverse) that we may write with and . Assume , for otherwise LABEL:{s=t} applies. This implies (since ).
**Subcase 6.1.1 . *** Assume there exists , such that .
Let . Note that corollary 3.8 implies and are even, and (so ).*
Choose a hamiltonian cycle in \operatorname{Cay}\bigl{(}\overline{G}/\langle\overline{a}\rangle;S\smallsetminus\{a,b\}\bigr{)}, such that , and define as in (5.1A). Then contains by the same calculation as in case 5.1.
Since , we may construct a hamiltonian cycle in by replacing the path at the start of with . Then
[TABLE]
This is a generator of , since inverts , but not . Hence, either or generates , so lemma 2.8 provides a hamiltonian cycle in .
**Subcase 6.1.2 . *** Assume there does not exist , such that .
Choose , such that . (It is possible that , but we know, by the assumption of this case, that .) Let and . From corollary 3.8 (and the assumption of this case), we know and are even.*
We have the following hamiltonian cycle in \operatorname{Cay}\bigl{(}\langle\overline{a},\overline{d}\rangle;a,d\bigr{)}:††margin:
[note A.32]
[TABLE]
As in the final paragraph of case 6.1, another hamiltonian cycle can be constructed by replacing the path at the start of with , and the calculation in case 6.1 shows that generates . Therefore, since , but , we see that lemma 3.15(1) applies (with , , , and ). ∎
Case 6.2**.**
Assume and inverts .
**Proof. **As in case 6.1, we let and write with and . We now consider the same five subcases as in [5, pp. 60–62].
**Subcase 6.2.1 . ***Assume and is even.
Let . The proof in the last paragraph of [5, p. 60] provides a hamiltonian cycle*
[TABLE]
in \operatorname{Cay}\bigl{(}\langle\overline{a}\rangle;a,b\bigr{)}, such that is a generator of .††margin:
[note A.33]
Therefore, corollary 3.16 applies (with ), because and both contain the oriented edge .
**Subcase 6.2.2 . ***Assume and is odd.
Let*
[TABLE]
Calculations in [5, p. 61] show that is a generator of . Therefore, corollary 3.16 applies (with ), because and both contain the oriented edge .
**Subcase 6.2.3 . ***Assume and is even.
We follow the argument of [12, Subcase iii, p. 97]. Since is even, we know centralizes , so*
[TABLE]
Therefore corollary 2.9 applies (with and ).
**Subcase 6.2.4 . ***Assume and is odd.
Choose so that , if such exists. Otherwise, choose so that there exists , such that . In either case, corollary 3.8 implies , and is even.*
We may assume , for otherwise corollary 2.9 applies (with and ). Therefore, noting that inverts (since is odd), we have
[TABLE]
**Subsubcase 6.2.4.1 . ***Assume .
It suffices to find a hamiltonian cycle in , such that projects nontrivially to , and contains the paths and . For then lemma 2.12 (with , , , and ) provides a hamiltonian cycle , such that . Therefore, either or generates , so lemma 2.8 applies.*
Note that ††margin:
[note A.34]
[TABLE]
is a cycle through the vertices of in . A connected sum of translates of yields a hamiltonian cycle in .
If , then the connected sum defining can be chosen so that (see the proof of lemma 3.15). So we may let .
We may now assume . Construct a hamiltonian cycle in by replacing the rightmost translate of in the connected sum with††margin:
[note A.35]
[TABLE]
A straightforward calculation shows that ,††margin:
[note A.36]
so we have for some . Let .
** Assumptions 6.2.4.2****.**
We may now assume , so the irredundance of implies . Since , the irredundance of also implies .††margin:
[note A.37]
Furthermore, we may also assume that either centralizes or inverts . (Otherwise, a preceding case applies after interchanging with .)††margin:
[note A.38]
**Subsubcase 6.2.4.3 . ***Assume inverts .
Let*
[TABLE]
Then is a hamiltonian path in \operatorname{Cay}\bigl{(}\langle\overline{a}\rangle;a,b\bigr{)},††margin:
[note A.39]
so is a hamiltonian cycle in . Since ,††margin:
[note A.40]
we have††margin:
[note A.41]
[TABLE]
Thus, in either case, we have , where and is odd, so
[TABLE]
This generates , so lemma 2.8 applies.
**Subsubcase 6.2.4.4 . ***Assume centralizes and .
Let*
[TABLE]
where . Since contains both and , and also contains both and we can apply lemma 2.12 twice (first with , , , and , and then with , , , and ), to obtain a hamiltonian cycle , such that††margin:
[note A.42]
[TABLE]
which generates . Then, since ††margin:
[note A.43]
[TABLE]
is a generator of , we conclude that generates , so lemma 2.8 applies.
**Subsubcase 6.2.4.5 . ***Assume centralizes and .
Assume, for the moment, that . Let††margin:
[note A.44] *
[TABLE]
Then is a hamiltonian cycle in , and a straightforward calculation shows that ††margin:
[note A.45] generates , so lemma 2.8 applies.
Now, suppose that , and, because of the preceding paragraph, that . Let††margin:
[note A.46]
[TABLE]
Then is a hamiltonian cycle in and††margin:
[note A.47]
[TABLE]
Therefore (since and projects trivially to ), so lemma 2.8 applies.
We may now assume (so ), and that . Let . We have the following hamiltonian cycle in : ††margin:
[note A.48]
[TABLE]
Calculating modulo (so is in the center), we have
[TABLE]
This is nontrivial (mod ), so must be nontrivial. Therefore generates , so lemma 2.8 applies.
**Subcase 6.2.5 . ***Assume . *
**Subsubcase 6.2.5.1 . ***Assume .
Note that††margin:
[note A.49] *
[TABLE]
is a cycle through the vertices of in . A connected sum of translates of yields a hamiltonian cycle in . Since is even, we know that , so it is easy to choose the connected sum in such a way that (see the proof of lemma 3.15).
The cycle contains the paths and . By taking just a bit of care in the creation of (namely, not using any of these edges for the first connected sum), we may assume that also contains these paths. Then lemma 2.12 (with , , , and ) provides a hamiltonian cycle , such that ††margin:
[note A.50]
(because centralizes ). This is a generator of , so either or generates . Therefore, lemma 2.8 applies.
**Subsubcase 6.2.5.2 . ***Assume .
The irredundance of implies that (see corollary 3.5). We have the following hamiltonian cycle in :††margin:
[note A.51] *
[TABLE]
Since , the irredundance of implies .††margin:
[note A.37]
So is even (see corollary 3.8). However, , because is even. So††margin:
[note A.52]
[TABLE]
which generates . We may also assume that either centralizes or inverts (for otherwise a preceding case applies after interchanging with ).††margin:
[note A.38]
Therefore††margin:
[note A.53]
[TABLE]
which generates . We now know that projects nontrivially to both and , so it generates . Therefore, lemma 2.8 applies. ∎
7 Cases with and
Assumption 7.1**.**
In this Section, we assume
- •
, for all , such that does not centralize , and
- •
.
We may assume , for otherwise case 4.1 applies with and .
We may also assume that centralizes , for otherwise we must have , so , so theorem 2.3 applies. Since does not centralize , this implies . Let
[TABLE]
Case 7.2**.**
Assume .
**Proof. **Let , so is a hamiltonian cycle in with , since centralizes . Note that is even (see corollary 3.8), and, by assumption, . Therefore, is relatively prime to , so generates , so lemma 2.8 applies. ∎
Case 7.3**.**
Assume .
**Proof. **We claim that . Suppose not. Then . Since , the abelian group has a unique subgroup of order , so we conclude that is normal in . This implies that
[TABLE]
so
[TABLE]
This contradicts the fact that .
**Subcase 7.3.1 . ***Assume .
Combining this assumption with the above claim, we see that . This implies , so . Since , this implies that is a generalized Petersen graph. Then the main result of [2] tells us that has a hamiltonian cycle.††margin:
[note A.54] *
**Subcase 7.3.2 . *** Assume .
Since is abelian, , and , we may write*
[TABLE]
Then , and we may assume and . For , it is straightforward to check that \bigl{(}(a,b)^{4}\#,b^{-1}\bigr{)} is a hamiltonian cycle in whose voltage is .††margin:
[note A.55]
(This hamiltonian cycle is taken from the final paragraph of Case 1 of the proof of [4, Prop. 6.1].) This voltage generates (since ), so lemma 2.8 applies. ∎
8 Cases with and
Assumption 8.1**.**
In this Section, we assume
[TABLE]
and
[TABLE]
We also assume case 4.1 does not apply. (So .) In particular, we have .
Note that . (If , then , like , does not centralize , so our assumption implies . Then , contradicting the fact that case 4.1 does not apply.)
Notation 8.2**.**
Let
[TABLE]
The last inequality is because the irredundance of implies (see corollary 3.5).
Case 8.3**.**
Assume .
**Proof. **Since , Assumption 8.1 implies that centralizes . Also, since is odd, corollary 3.8 implies that and project trivially to , so must project nontrivially (and must be even). We have the following hamiltonian path in \operatorname{Cay}\bigl{(}\overline{G}/\langle\overline{a}\rangle;S\bigr{)}:††margin:
[note A.56]
[TABLE]
Then is a hamiltonian cycle in . Since is odd, it is easy to see that .††margin:
[note A.57]
Since contains both and , lemma 2.12 (with , , , and ) provides a hamiltonian cycle , such that is conjugate to . This is an element of . If it generates , then either or generates , so lemma 2.8 applies.
Thus, we may assume is trivial. Since (see (3.3B)), this implies that is nontrivial. So we may assume that does not centralize (for otherwise replacing with would replace with , which would not cancel ).
Now, assumption 8.1 implies , so we have the hamiltonian cycle††margin:
[note A.58]
[TABLE]
in . This contains both the path and the edge , so applying lemma 2.12 (with , , , and ) provides a hamiltonian cycle , such that \bigl{(}\mathop{\Pi}C_{0}\bigr{)}^{-1}\bigl{(}\mathop{\Pi}C_{1}\bigr{)} is conjugate to . This is not equal to (which is trivial), because , but . So \bigl{(}\mathop{\Pi}C_{0}\bigr{)}^{-1}\bigl{(}\mathop{\Pi}C_{1}\bigr{)} is nontrivial, and therefore generates . Since a straightforward calculation shows that is contained in ,††margin:
[note A.59]
this implies that either or generates , so lemma 2.8 applies. ∎
Case 8.4**.**
Assume .
**Proof. **We may assume , for otherwise either , so theorem 2.3 applies (because ), or , so case 8.3 applies. Let††margin:
[note A.60]
[TABLE]
so is a hamiltonian path in \operatorname{Cay}\bigl{(}\langle\overline{a},\overline{b}\rangle;a,b\bigr{)} and is a hamiltonian cycle in .
**Subcase 8.4.1 . ***Assume and are not both in .
A straightforward calculation (using lemma 3.6) shows that .††margin:
[note A.61]
If this is in , then, by assumption, , so applying lemma 2.12 to the paths and in (so , , , and ) yields a hamiltonian cycle , such that projects nontrivially to .††margin:
[note A.62]
Therefore, we have a hamiltonian cycle (either or ) whose voltage is not in .*
Now, since , we know that (and also ) contains the paths and . Furthermore, we know that is a nontrivial element of (because does not invert ). Therefore, lemma 2.12 (with , , , and ) yields a hamiltonian cycle (or ) whose voltage generates , so lemma 2.8 applies.
**Subcase 8.4.2 . ***Assume and are both in .
Since , , and generate , they cannot all be in , so this assumption implies that neither nor is in . Also, we may assume , for otherwise , so we could apply lemma 2.13 with .*
We have the following hamiltonian cycle in :††margin:
[note A.63]
[TABLE]
Then
[TABLE]
If centralizes , then generates , so lemma 2.8 applies.
We may now assume does not centralize . Then assumption 8.1 tells us that inverts , so (and ). Hence, we may assume , for otherwise generates , so lemma 2.8 applies. We now consider the following hamiltonian cycle in :††margin:
[note A.64]
[TABLE]
We have
[TABLE]
Since inverts , we know that ,††margin:
[note A.65]
so is exactly the same as the voltage of , but with replaced by ; that is,
[TABLE]
Since , we have
[TABLE]
so generates , so lemma 2.8 applies. ∎
Case 8.5**.**
Assume and .
**Proof. **Since , we know , so must centralize (by assumption 8.1). Also, corollary 3.8 implies that and cannot both be odd.
- •
If is odd (so is even), let††margin:
[note A.66]
[TABLE]
- •
If is even, let††margin:
[note A.67]
[TABLE]
In either case, is a hamiltonian path in \operatorname{Cay}\bigl{(}\overline{G}/\langle\overline{a}\rangle;\{b,c\}\bigr{)} from to . Now, let
[TABLE]
so is a hamiltonian cycle in that contains the paths
[TABLE]
Note that contains and that contains . Also note that all of these paths are vertex-disjoint (except for the vertices and when and ). We introduce some terminology:
- •
Applying lemma 2.12 to the oriented paths and (so , , , and ) will be called the “-transform.” This multiplies the voltage by , where .††margin:
[note A.68]
- •
Applying lemma 2.12 to the oriented paths and (so , , , and ) will be called the “-transform.” This multiplies the voltage by a conjugate of , where .††margin:
[note A.69]
**Subcase 8.5.1 . *** Assume precisely one of and is in .
Write , such that and . We may assume (by replacing with its inverse, if necessary). Choose to be either or the -transform of , such that projects nontrivially to . Then choose to be either or the -transform of , such that generates , so lemma 2.8 applies.*
**Subcase 8.5.2 . ***Assume and are both in .
Since , , and cannot all be in , this assumption implies that none of them are in . Therefore, since the path has odd length, we see that has nontrivial projection to .††margin:
[note A.70] *
We may assume (by replacing with its inverse, if necessary), that has nontrivial projection to , so . Therefore, by choosing to be either or the -transform of , such that generates , we may apply lemma 2.8.
**Subcase 8.5.3 . *** Assume neither nor is in , and centralizes .
Note that the sum of the exponents of the occurrences of in is , and the sum of the exponents of the occurrences of is [math]. Therefore, since and centralize , lemma 3.6 implies that .††margin:
[note A.71]
Hence, we may assume (for otherwise , so lemma 2.8 applies). Then, by the assumption of this case, we conclude that . So we may assume , for otherwise and could be interchanged, resulting in a situation in which , and which has therefore already been covered. Also, since and , corollary 3.8 tells us that is even (and recall that ).*
Since is a nontrivial element of , and centralizes , we see from corollary 3.7 that is divisible by . Therefore, , so we may assume (for otherwise case 4.1 applies with and ). Since (by the assumption of this case), this implies , so we may let††margin:
[note A.72]
[TABLE]
so is a hamiltonian path from to in \operatorname{Cay}\bigl{(}\overline{G}/\langle\overline{a}\rangle;\{b,c\}\bigr{)}. Note that the sum of the exponents of the occurrences of in is , and the sum of the exponents of the occurrences of is . Therefore, since and centralize , lemma 3.6 implies . This generates , so lemma 2.8 applies.
**Subcase 8.5.4 . *** Assume neither nor is in , and does not centralize .
From assumption 8.1, we know (so must invert ).*
We may assume , for otherwise case 8.4 could be applied by interchanging and . Then we may assume is the nontrivial element of , for otherwise the assumption that implies , so , and then lemma 2.13 applies with .
By applying the same argument, with and interchanged, we may assume is also the nontrivial element of . This implies , since .
Note that, since and both have order (and invert ), the image of in is the dihedral group of order . Also, the preceding two paragraphs imply that is in the center of . Therefore, we have the following hamiltonian cycle in \operatorname{Cay}\bigl{(}G/\mathbb{Z}_{2};S\bigr{)}:††margin:
[note A.73]
[TABLE]
Since projects trivially to , corollary 3.8 implies that is even, so, calculating modulo , we have
[TABLE]
Since this generates , lemma 2.8 applies. ∎
9 Cases with and
Assumption 9.1**.**
In this Section, we assume
- •
, and
- •
, for all , such that does not centralize .
We also assume case 4.1 does not apply. (So .)
Furthermore, we assume (otherwise, case 4.1 applies). Then it is easy that we also have .††margin:
[note A.74]
Outline**.**
This final Section of the proof is longer than the others, so here is an outline of the cases and subcases that it considers.
- 9.4:
Assume no element of centralizes .
- 9.4:
Assume .
- 9.4:
Assume .
- 9.5:
Assume there exists , such that , and, in addition, either , or centralizes , or .
- 9.5:
Assume .
- 9.5:
Assume .
- 9.6:
Assume centralizes .
- 9.6:
Assume there exists , such that .
- 9.6:
Assume for all .
- 9.7:
Assume that none of the preceding cases apply.
Since case 9.4 does not apply, some element of centralizes .
- 9.7:
Assume , for some .
- 9.7:
Assume , for all .
Notation 9.2**.**
Let and .
Note 9.3**.**
The irredundance of implies is an irredundant generating set for (see corollary 3.5), so .
Case 9.4**.**
Assume no element of centralizes .
**Proof. **From assumption 9.1, we see that every element of inverts (and has order ). We may assume no two elements of commute, for otherwise it is not difficult to see that lemma 2.13 applies.††margin:
[note A.75]
Let , and let . We claim that we may assume , by permuting . To this end, first note that if , then , so there is no harm in putting into the role of . Now, let us suppose , , and are all in . Then
[TABLE]
which contradicts the fact that (and is odd).
Let††margin:
[note A.76]
[TABLE]
so is a hamiltonian cycle in \operatorname{Cay}\bigl{(}\langle\overline{a},\overline{b},\overline{c},\overline{d}\rangle;\{a,b,c,d\}\bigr{)} that contains the vertex-disjoint paths , , , and . Applying lemma 2.12 to the paths and (so , , , and ) will multiply the voltage by .††margin:
[note A.77]
Applying lemma 2.12 to the other two paths and (so , , , and ) will also multiply the voltage by ††margin:
[note A.78]
(because and both centralize ). Therefore, applying lemma 2.12 twice yields a hamiltonian cycle , such that , which is a generator of .
**Subcase 9.4.1 . *** Assume .
If there exist , such that , and , then the preceding paragraph implies that lemma 3.15(2) applies.*
Thus, we may assume that the preceding condition does not apply (for any legitimate choice of , , and ). Fix two elements . The failure of the condition implies . In particular, must be a generator of (because no two elements of commute), so we may let play the role of . So we may let play the role of . Then, since , the failure of the condition implies . Similarly, and are also in . So for all . This contradicts the fact that .
**Subcase 9.4.2 . *** Assume .
For convenience, in this case (and only in this case), we drop our standing assumption that contains . Instead, choose , such that projects nontrivially to . A straightforward calculation (using the fact that , , , and all invert ) shows that††margin:
[note A.79] *
[TABLE]
Since projects nontrivially to , but and have even exponents, so they obviously do not, we see that . Therefore, we may assume , for otherwise lemma 2.8 applies.
We may assume , for otherwise applying lemma 2.12 twice (as in the paragraph immediately before case 9.4) yields a hamiltonian cycle whose voltage generates , so lemma 2.8 applies. By the definition of , this means . And we may assume the same is true when and are interchanged, which means . So
[TABLE]
By interchanging and , we conclude that we may also assume
[TABLE]
So
[TABLE]
Therefore
[TABLE]
If , then, since we may assume the same is true when we interchange and , we conclude that .††margin:
[note A.80]
Since we also have , we conclude that and are in . This implies (since does not centralize , and is therefore not in the center of ), so
[TABLE]
This contradicts the fact that .
We now assume . Then the equation implies . This conclusion came from assuming only that . Therefore, for all , the commutator must be in either or . However,
[TABLE]
and . Therefore, we conclude all five of these other commutators are in . (Therefore, the stated congruences between these commutators are actually equalities.)
Now, interchanging and in yields a hamiltonian cycle , such that
[TABLE]
(because ). Let , so is obtained from by interchanging and . Then, since applying lemma 2.12 to can multiply the voltage by , we know that applying lemma 2.12 to can multiply the voltage by , which generates . So lemma 2.8 applies. ∎
Case 9.5**.**
Assume there exists , such that , and:
[TABLE]
**Proof. **Let . Note that the irredundance of implies (see lemma 3.4).
**Subcase 9.5.1 . *** Assume .
If , we assume that . Let*
[TABLE]
Note that .††margin:
[note A.81]
Let . From the assumption of this case, we know that is abelian. Therefore, corollary 2.11 provides a hamiltonian path in , such that . Then is a hamiltonian cycle in , and
[TABLE]
(since is in the center of ). This voltage generates , so lemma 2.8 applies.
**Subcase 9.5.2 . *** Assume .
Suppose , such that*
[TABLE]
It is easy to construct a hamiltonian cycle in , such that contains the oriented paths and , for some .††margin:
[note A.82]
Furthermore, if
[TABLE]
then, for some , it is not difficult to arrange that the hamiltonian cycle contains the oriented edge ,††margin:
[note A.83]
and that this edge is not in either of the above-mentioned paths.
Applying lemma 2.12 to the first two paths (so , , and ) yields a hamiltonian cycle , such that is conjugate to . Removing the edge yields hamiltonian paths and from to .
From lemma 3.4 and the assumption of this case, we see that .††margin:
[note A.84]
So
[TABLE]
are hamiltonian cycles in . For , we have
[TABLE]
Since , and is central modulo (and from the choice of ), we have
[TABLE]
Furthermore, if projects nontrivially to , then does not centralize modulo , so and are not both in . This implies that generates for some , so lemma 2.8 applies. Therefore (after replacing with for simplicity), we may assume
[TABLE]
We will show that this leads to a contradiction.
Assume, for the moment, that centralizes . Then (because corollary 3.7 implies that ), so . Therefore (9.5B) is automatically satisfied. Let , such that . We see from Note 9.3 that (9.5A) is satisfied for , so (9.5C) tells us
[TABLE]
However, we also know that (because we are assuming in this paragraph that centralizes ). Therefore
[TABLE]
so (for all ). Then, since , we conclude that , for all . This contradicts the assumption of this case.
Now assume does not centralize . We may assume case 9.4 does not apply, so is centralized by some (and ). Let with . Combining the irredundance of with the fact that implies that (9.5A) is satisfied for ††margin:
[note A.85]
(unless , when case 4.1 applies). We may assume (by interchanging and , if necessary), so (9.5B) is satisfied. Then (9.5C) tells us
[TABLE]
Since centralizes , this implies , so (for all ). Since , this implies (for all ). This contradicts the assumption of this case. ∎
Case 9.6**.**
Assume centralizes .
**Proof. **We consider two cases.
**Subcase 9.6.1 . *** Assume there exists , such that .
We use some of the arguments of case 8.5. We may assume for all . (Otherwise, case 9.5 applies, because centralizes .) Therefore . Let be a hamiltonian path from to in \operatorname{Cay}\bigl{(}\overline{G}/\langle\overline{a}\rangle;S\smallsetminus\{a\}\bigr{)}, such that , and contains a path of the form ††margin:
[note A.86]
(for some ) that is vertex-disjoint from . Now let . Then contains vertex-disjoint paths of the form*
[TABLE]
- •
Applying lemma 2.12 to and (so , , , and ) will be called the “-transform.” It multiplies the voltage by††margin:
[note A.87]
[TABLE]
- •
Applying lemma 2.12 to and (so , , , and ) will be called the “-transform.” It multiplies the voltage by a conjugate of††margin:
[note A.88]
[TABLE]
Since and we know and . Also, we may also assume is nontrivial (by replacing with if necessary). Therefore, the argument of case 8.5 applies. Namely, choose to be either or the -transform of , such that projects nontrivially to . Then choose to be either or the -transform of , such that generates , so lemma 2.8 applies.
**Subcase 9.6.2 . *** Assume for all .
Choose , such that . Assuming that cases 9.5 and 9.6 do not apply, we have*
[TABLE]
Therefore, , and the element is in , and we may assume (by replacing with its inverse, if necessary) that generates .
Let , and choose a hamiltonian cycle in \operatorname{Cay}\bigl{(}\langle\overline{S_{0}}\rangle;S_{0}\bigr{)} that contains the oriented paths ††margin:
[note A.89]
and , and has at least two edges labelled , for every . Lemma 2.12 (with , , , and ) provides a hamiltonian cycle , such that is conjugate to ,††margin:
[note A.90]
and therefore generates . Furthermore, contains all of the oriented edges of that are not in these two above-mentioned paths, so lemma 3.15(2) applies (with and ). ∎
Case 9.7**.**
Assume that none of the preceding cases apply.
**Proof. **This implies that:
- #1.
. (Otherwise, case 9.5 applies.) 2. #2.
If , and there exists , such that inverts and , then inverts . (If does not invert , then we see from assumption 9.1 that centralizes , so case 9.6 applies with and in the roles of and , respectively.) 3. #3.
There exists , such that centralizes . (Otherwise, case 9.4 applies.) From (#2), we know .
**Subcase 9.7.1 . *** Assume , for some .
Suppose, for the moment, that centralizes . Then lemma 3.6 implies \bigl{[}a,[s,c]\bigr{]}=\bigl{[}[a,s],[a,c]\bigr{]}=e (because is abelian), so projects trivially to . Since , we conclude from this that , so lemma 2.16 applies.*
We may now assume does not centralize , so there is no harm in assuming that . Since (#2) implies that , we see that must be trivial. Let . We may assume , for otherwise , so lemma 2.13 applies with and . Therefore, for all , but there is some , such that projects nontrivially to .
Similarly, we may assume , for otherwise , so lemma 2.13 applies with and . This means for all . In particular, since and are in both and , we must have .
Choose a hamiltonian cycle in \operatorname{Cay}\bigl{(}\overline{H};S\smallsetminus\{c\}\bigr{)} that contains the oriented paths and .††margin:
[note A.91]
If we apply lemma 2.12 to these paths (so , , , and ), then the voltage is multiplied by a conjugate of ,††margin:
[note A.92]
which is a generator of (since generates and is trivial). Therefore, lemma 3.15(1) applies with and .
**Subcase 9.7.2 . *** Assume , for all .
For convenience, let and . Then is prime, so theorem 1.1 provides a hamiltonian path in \operatorname{Cay}\bigl{(}\widehat{H};S\smallsetminus\{c\}\bigr{)}. Since is central in , there is a spanning subgraph of that is isomorphic to the Cartesian product , where . Since is even, it is easy to find a hamiltonian cycle in (see lemma 2.10), and this yields a hamiltonian cycle in .*
To complete the proof, we carry out a straightforward (and well-known) calculation to verify that is nontrivial, so lemma 2.8 applies.
If we view the Cartesian product as a grid of squares, then the interior of the hamiltonian cycle is a union of squares of the grid. Graph theoretically, this means is the connected sum of some number of digons of the form (where ). Note that if is an -cycle (with ), then is an -cycle. Therefore, since the length of is , we have , so is even.
Now, each -cycle in is of the form , where one of and is in , and the other is in . This means that in any connected sum , one of and is in , and the other is in . By the assumption of this case, we conclude that , where is the generator of . Therefore
[TABLE]
Appendix A Notes to aid the referee
A.1**.**
Write .
(1) Suppose has another representation: . Since is a vertex on , there is some , such that . Then for all (with subscripts read modulo ). Also, letting , we have , so (since is normal) there is some , such that . Therefore
[TABLE]
This means that the two representations and yield the same value for the voltage, so the voltage is well defined.
(2) We have , so
[TABLE]
(3) We have , so
[TABLE]
A.2**.**
We have
[TABLE]
A.3**.**
*Case 1 . Assume that contains . * Construct by replacing:
- •
the oriented edge with the oriented path , and
- •
the oriented path with the oriented edge .
: :
To calculate the voltage of , write . Then and there is some with , so , and we have
[TABLE]
Note that if we let , then , so for all (since is commutative). Therefore
[TABLE]
*Case 2 . Assume that contains . * Construct by replacing:
- •
the oriented edge with the oriented path , and
- •
the oriented path with the oriented edge .
: :
To calculate the voltage of , write . Then and there is some with , so , and we have
[TABLE]
Then
[TABLE]
Conjugating both sides by yields
[TABLE]
Now note that
[TABLE]
A.4**.**
Case 4.5 of [12] (on page 95) considers certain groups of order . Near the start of [12, §4] (on page 92), it is stated that “In every case except 4.5, we use the Factor Group Lemma 2.3 on .” Replacing with , this means there is a hamiltonian cycle in whose voltage generates (unless , which we have ruled out).
A.5**.**
Fix some , and define by . From lemma 3.6, we know that is a homomorphism. Since , this homomorphism is nontrivial, so it must be surjective (since is prime). Therefore . Also, we have . So is divisible by .
A.6**.**
If is a subset of , then it is obvious that is a subgraph of . Therefore, in order to show that every connected Cayley graph on has a hamiltonian cycle, it suffices to consider only the irredundant generating sets.
A.7**.**
Suppose is nontrivial. Since has prime order, this implies . However, is a normal subgroup that has no automorphisms, so . Therefore, contains both and , and therefore contains all of . This contradicts the fact that is not nilpotent.
A.8**.**
If , then, since , we must have . If this is true for all , then for all (because and ). In particular, . However, we also have , because . Therefore, . This contradicts (3.3A).
A.9**.**
We have
[TABLE]
A.10**.**
Let . We have , so . If , this implies , which contradicts the fact that is nontrivial (because .
A.11**.**
Let . By assumption, there exists , such that . Every element of centralizes , so lemma 3.6 tells us that the map is a homomorphism from to . Since (and ), we know is contained in the kernel of . But , so the kernel of is a subgroup of index in . Therefore
[TABLE]
A.12**.**
The connected sum joins and into a single large cycle by replacing the two white edges labelled and with the two black edges labelled and .
A.13**.**
Let . We verify the hypotheses of lemma 3.15 with in the role of and with in the role of .
- •
is a nontrivial element of (by assumption).
- •
By construction of the connected sum, and both contain the oriented edge .
- •
By construction of the connected sum (and the fact that ), contains the oriented edges and . Also, for every , contains at least two edges and that are labelled either or . Then the subgraph of induced by contains at least one of these edges, and the subgraph of induced by contains either or ; so contains at least two edges that are labelled either or .
- •
We know and . The latter implies , so .
- •
We are letting .
- •
By assumption, either
there exists , such that , or 2. 2.
is even.
The first condition makes no mention of , , or , so remains true with in the role of and with in the role of . Since , we have . So the second condition tells us that is even.
A.14**.**
Suppose , so . Then, calculating mod , we have
[TABLE]
By the definition of , this implies . So .
A.15**.**
The choice of the oriented edge of that is used in the connected sum is arbitrary, except that was chosen to make the projection of to is nontrivial. Therefore, if , then we may use any edge that we want in order to make the connected sum .
So we may now assume . This means . Therefore, by assumption, we must have . Also, as was mentioned in the proof, we must have . So . Therefore, we may assume that the connected sum is relative to the oriented edge of that is also in .
A.16**.**
Suppose there exist and , such that projects trivially to . Note that, by the assumption of this lemma, we must have .
By applying the assumption of this lemma with in the place of (and noting that ), we see that . 2. 2.
By the choice of , we know that .
Therefore, the hypotheses of the lemma are satisfied with and in the roles of and , respectively. Furthermore (2) tells us that lemma 3.15 applies.
A.17**.**
Suppose contains . Note that also contains . Therefore, we have
[TABLE]
So lemma 3.4 tells us that . This contradicts the irredundance of , so we conclude that does not contain . A similar argument shows that does not contain .
Suppose is an element of that does not centralize . Then is not in the center of , so there is some , such that . We may assume (perhaps after interchanging and ) that , so . Then and are both in , so the commutator subgroup of is not contained in . Since , this implies that the commutator subgroup of contains . So contains . This contradicts the preceding paragraph, so we conclude that every element of that centralizes .
A.18**.**
Suppose centralizes . Since and it is obvious that centralizes (because ), we conclude that also centralizes . From the conclusion of the preceding paragraph, we conclude that every element of centralizes . Since generates , this implies that every element of centralizes . This contradicts (3.3A), so we conclude that does not centralize . A similar argument shows that does not centralize .
A.19**.**
Since is even, we may let
[TABLE]
A.20**.**
Since and , we have . Therefore generates .
Now, we claim that is an irredundant generating set of . If not, then some proper subset of generates . This means . From lemma 3.4, we conclude that . Since , this implies , so is prime. Therefore, if we choose to be any element of , then . However, cannot be all of , because
[TABLE]
This contradicts the irredundance of .
A.21**.**
It is obvious that is a hamiltonian path in \operatorname{Cay}\bigl{(}\overline{G};S\smallsetminus\{s\}\bigr{)}.
[TABLE]
Therefore, we need only verify that . We have
[TABLE]
so we wish to show is trivial.
Suppose is nontrivial. Since is a (hamiltonian) cycle in the graph \operatorname{Cay}\bigl{(}\overline{G}/\langle\overline{t}\rangle;S\smallsetminus\{s,t\}\bigr{)}, we know . Therefore, must be (since this is the only nontrivial element of ). However, we also know (because each is in ), so this implies that . Therefore
[TABLE]
This contradicts the fact that is an irredundant generating set of .
A.22**.**
Since is a hamiltonian cycle in \operatorname{Cay}\bigl{(}\overline{G};S\smallsetminus\{s\}\bigr{)}, we know .
On the other hand, it was pointed out in the first paragraph of the proof of this case that does not contain . Since , we conclude that . So .
A.23**.**
[TABLE]
A.24**.**
Since , we have , which implies for all . Therefore . Since is even and , this implies is trivial. Since is an arbitrary element of , this implies .
A.25**.**
We have . Therefore:
- •
Calculating modulo , we have
[TABLE]
since centralizes . Therefore is trivial modulo . In other words, .
- •
We have , since does not centralize . This implies is nontrivial.
Combining these two observations tells us that is a generator of .
A.26**.**
By assumption, is in the center of , so . Let . Since , corollary 3.8 tells us that is even.
A.27**.**
Let , and let . It has been pointed out that the image of in has even order, which means that is even.
Suppose . We may let be a hamiltonian path in \operatorname{Cay}\bigl{(}\widehat{H}/\langle\widehat{c}\rangle;S\smallsetminus\{c,d\}\bigr{)}, such that . Then we may take to be the following hamiltonian cycle:
[TABLE]
If , then we may write with , so we let
[TABLE]
We now assume . If , then we modify the above-pictured hamiltonian cycle, by replacing a single occurrence of with . Otherwise, we write with , and replace the path at the end of the above-pictured hamiltonian cycle with .
A.28**.**
[TABLE]
A.29**.**
It is a general group-theoretic fact that if does not invert , then does not commute with . This is because
[TABLE]
so iff .
Let . Since (and does not centralize ), we know that acts on via an automorphism of order . So does not invert (because is a generator of ). Therefore, the general fact tells us that does not commute with , so is a generator of . Since acts on via , which is an automorphism of order , we know that does not invert . So the general fact tells us that does not commute with . This means . Conjugating by , we conclude that .
A.30**.**
Suppose and are both in . This means that and both commute with (mod ), so the product also commutes with (mod ). For convenience, call this product . Then
[TABLE]
so . Furthermore, we have observed that , so . Therefore . Since commutes with (mod ), we conclude that centralizes , and therefore centralizes . This is a contradiction.
A.31**.**
If centralizes , then is in the center of . Therefore, by using lemma 3.6 as in the proof of corollary 3.9 (but replacing with ), we see that is divisible by . Since and , this is a contradiction.
A.32**.**
[TABLE]
A.33**.**
To see that is a generator of , we repeat the calculation in the last paragraph of [5, p. 60] (using our notation). However, it is important to note that centralizes (because inverts and is even). We have:
[TABLE]
This is a generator of . Therefore, is also a nontrivial element of , since it is conjugate to the inverse of .
A.34**.**
[TABLE]
A.35**.**
[TABLE]
A.36**.**
We have and (since is even). Therefore
[TABLE]
and
[TABLE]
So .
A.37**.**
Since , we see from the contrapositive of corollary 3.8 that . Therefore, we must have . On the other hand, since , but , we see from the contrapositive of corollary 3.5 that . Therefore is the nontrivial element of .
A.38**.**
Suppose neither centralizes nor inverts . Since does not centralize , we know that it does not centralize , so there exists , such that .
If , then we may apply case 6.1 with and in the roles of and .
Suppose, now, that . Since neither centralizes nor inverts , we know . So one of the cases of Section 5 applies with and in the roles of and .
A.39**.**
The path is a hamiltonian cycle in :
[TABLE]
Removing a single edge from this hamiltonian cycle yields the hamiltonian path .
A.40**.**
Since is even (and inverts ), we know that centralizes . So
[TABLE]
A.41**.**
If , then
[TABLE]
If , then
[TABLE]
A.42**.**
Let be the hamiltonian cycle obtained from by applying lemma 2.12 to and (so , , , and ). Then
[TABLE]
Since inverts , but centralizes , this tells us
[TABLE]
Also, since is obtained from by applying lemma 2.12 to the path and the edge (so , , , and ), we have
[TABLE]
Since and invert , but centralizes , this tells us
[TABLE]
Putting these two calculations together tells us
[TABLE]
A.43**.**
Since centralizes , the map is a homomorphism to whose kernel contains . Therefore
[TABLE]
A.44**.**
[TABLE]
A.45**.**
Let be the nontrivial element of , so . Then
[TABLE]
A.46**.**
[TABLE]
A.47**.**
We have
[TABLE]
Since , we have . Also, we have
[TABLE]
Therefore .
A.48**.**
Let be the nontrivial element of . Then every element of can be written uniquely in the form with and . The hamiltonian cycle visits the vertices of in the following order:
[TABLE]
A.49**.**
[TABLE]
A.50**.**
Lemma 2.12 tells us
[TABLE]
Since centralizes , we have
[TABLE]
and
[TABLE]
Therefore .
A.51**.**
[TABLE]
A.52**.**
Calculating modulo , we have
[TABLE]
A.53**.**
Calculating modulo , we have
[TABLE]
A.54**.**
The main result of [2] states that the generalized Petersen graph has a hamiltonian cycle if and
[TABLE]
(More generally, see [A, Thm. 3] for a complete determination of which generalized Petersen graphs have hamiltonian cycles.)
is the generalized Petersen graph , where and . We must have (because , like , must generate ), and it is obvious that (since is even), so Bannai’s theorem provides a hamiltonian cycle in .
References
- [A]
B. Alspach, The classification of Hamiltonian generalized Petersen graphs. J. Combin. Theory Ser. B 34 (1983), no. 3, 293–312. MR 0714452 http://dx.doi.org/10.1016/0095-8956(83)90042-4
A.55**.**
For the reader’s convenience, we translate the calculations in the last paragraph of Case 1 of the proof of [4, Prop. 6.1] into our notation.
Let be the nontrivial element of . Then every element of can be written uniquely in the form with . To see that \bigl{(}(a,b)^{4}\#,b^{-1}\bigr{)} is a hamiltonian cycle, note that it visits the vertices of in the following order:
[TABLE]
Since
[TABLE]
the voltage of this hamiltonian cycle is
[TABLE]
A.56**.**
[TABLE]
A.57**.**
Calculating modulo , we have
[TABLE]
This is nontrivial (mod ), so projects nontrivially to .
A.58**.**
[TABLE]
A.59**.**
Calculating modulo , we have
[TABLE]
This is nontrivial (mod ).
A.60**.**
[TABLE]
A.61**.**
Calculating modulo , we have
[TABLE]
A.62**.**
Since , lemma 2.12 tells us that
[TABLE]
By assumption, this projects nontrivially to .
A.63**.**
[TABLE]
A.64**.**
[TABLE]
A.65**.**
Write , with . Then
[TABLE]
A.66**.**
[TABLE]
A.67**.**
[TABLE]
A.68**.**
Let be the hamiltonian cycle obtained by applying the -transform. To show that the -transform multiplies the voltage by , we wish to show
[TABLE]
Lemma 2.12 tells us
[TABLE]
because . So
[TABLE]
because
[TABLE]
and
[TABLE]
A.69**.**
Lemma 2.12 tells us that the -transform multiplies the voltage by a conjugate of
[TABLE]
A.70**.**
Let be the nontrivial element of , and write , so and is odd. Then, calculating mod , we have for all , so
[TABLE]
A.71**.**
Since and centralize , lemma 3.6 implies that if we let , then is a homomorphism from to . Note that, since the image of is a subgroup of the abelian group , the kernel of must contain .
Write . Then \mathop{\Pi}C=\bigl{[}\bigl{(}\prod\nolimits_{i=1}^{r}s_{i})^{-1},a]. Since the sum of the exponents of the occurrences of in is , and the sum of the exponents of the occurrences of is [math], we know . So the preceding paragraph tells us that
[TABLE]
A.72**.**
[TABLE]
A.73**.**
[TABLE]
A.74**.**
Suppose .
If does not centralize , then assumption 9.1 tells us that , so we must have , which contradicts the assumption that case 4.1 does not apply.
We now know that centralizes . Since is abelian (indeed, it is cyclic), this implies that is abelian. However, the fact that means that . Since is abelian, this implies that centralizes . This contradicts (3.3A).
A.75**.**
Suppose , such that commutes with (and ). There exist , such that . Since , we may assume (after interchanging and if necessary). Since does not centralize , there exists , such that . Then , so
[TABLE]
so . Therefore lemma 2.13 applies
A.76**.**
Note that is a hamiltonian path in \operatorname{Cay}\bigl{(}\langle\overline{a},\overline{c}\rangle;\{a,c\}\bigr{)} (because we have ). Therefore
[TABLE]
is a hamiltonian path in \operatorname{Cay}\bigl{(}\langle\overline{a},\overline{b},\overline{c}\rangle;\{a,b,c\}\bigr{)}. So
[TABLE]
is a hamiltonian cycle in \operatorname{Cay}\bigl{(}\langle\overline{a},\overline{b},\overline{c},\overline{d}\rangle;\{a,b,c,d\}\bigr{)}.
A.77**.**
Lemma 2.12 tells us
[TABLE]
Since and both invert , we know that centralizes , so .
A.78**.**
This is exactly the same calculation as in A.77, except that is conjugated by , instead of . Since , like , centralizes , this change does not affect the result of the calculation at all, so, as before, the voltage is multiplied by .
A.79**.**
Note that
- •
if centralizes , then and , but
- •
if inverts , then and .
Therefore
[TABLE]
A.80**.**
We have . Assuming the same is true when we interchange and , we also have . So
[TABLE]
Since , this implies .
A.81**.**
Suppose , so . By the definition of , we also know . Therefore generates .
Assume now that , so . Calculating modulo , we have
[TABLE]
Calculating modulo , we have
[TABLE]
so generates .
A.82**.**
Let be the following hamiltonian path in \operatorname{Cay}\bigl{(}\langle\overline{w},\overline{x}\rangle;w,x\bigr{)}:
[TABLE]
Note that contains the oriented path . We can also write this path as , for .
Then is a cycle through the vertices of \operatorname{Cay}\bigl{(}\langle\overline{w},\overline{x},\overline{y}\rangle;w,x,y\bigr{)} that are in . Therefore, if is any hamiltonian cycle in \operatorname{Cay}\bigl{(}\langle\overline{w},\overline{x}\rangle;w,x\bigr{)} that shares an edge with , then an appropriate connected sum
[TABLE]
of with translates of is a hamiltonian cycle in .
Note that contains both and . Therefore, if the edge used to form the first connected sum is not in either of these paths, then also contains both of these paths. (For example, we could use the edge to form the connected sum.)
A.83**.**
It suffices to show that has an edge labeled that is not in either of the given paths, for we may assume that this oriented edge is of the form (by replacing with a translate).
If , then Note 9.3 implies there is at least one edge labeled . If , then this edge is obviously not in either of the given paths (since all of the edges in those paths are labeled ).
Therefore, we may assume . To deal with this situation, we assume has been constructed as in A.82 (from the path and cycle that are specified there).
Suppose . The edges and are in , but are not in either of the given paths. One of these edges may have been removed in forming the connected sum that defines , but the other will remain. So has at least one edge labeled .
Suppose .
- •
If , then contains the edges and . At least one of these must be in (and neither of these edges is in the given paths).
- •
If , then (in other words, in the definition of ). We may assume has at least one edge labeled , and that only edges labeled are used in forming the connected sums. Therefore, this edge labeled is in (and it is not in the given paths).
- •
We may now assume . Since (9.5B) tells us that (and we know ), we must have . Therefore, we have the following hamiltonian path in :
[TABLE]
Use this path in the place of to construct cycles and analogous to and (and let ). Note that has two edges labelled , so has four edges labelled . Two of these are in the given paths, and one may be deleted in the construction of the connected sum, but at least one of these edges labelled remains in and is not in either of the given paths.
We may now assume . From Note 9.3, we know that . Therefore, it is easy to construct a hamiltonian path in \operatorname{Cay}\bigl{(}\langle\overline{w},\overline{b}\rangle:b,w\bigr{)} that has at least one edge labeled , and such that . Now, in place of the hamiltonian path
[TABLE]
that was used in A.82, use the hamiltonian path
[TABLE]
to construct cycles and analogous to and (and let ). Then contains at least two edges labeled (one from the first occurrence of in , and another from the first occurrence of ). Neither of these is in the given paths (because ) and at least one of them remains in .
A.84**.**
Suppose . Then
[TABLE]
so lemma 3.4 implies . This contradicts the irredundance of .
A.85**.**
If , then Note 9.3 immediately implies that (9.5A) is satisfied. Then, since , we may assume . We wish to show . In other words, we wish to show .
Suppose . Then, since does not centralize , we know that does not centralize , so assumption 9.1 tells us that . Since , this implies that , so case 4.1 applies.
A.86**.**
Since and centralizes , we know is divisible by , so .
If is even, we may let be a hamiltonian path of the following shape:
[TABLE]
Henceforth, we assume that is odd. From corollary 3.8, we see that is even (so, in particular, ). And corollary 3.8 also implies that is even. Let be a hamiltonian path in \operatorname{Cay}\bigl{(}\overline{G}/\langle\overline{a},\overline{b}\rangle;S\smallsetminus\{a,b\}\bigr{)}, such that and for some . For example, could be of the following form:
[TABLE]
If , we may let be a hamiltonian path of the following shape:
[TABLE]
Now assume . The hamiltonian path that is pictured above can be extended to a hamiltonian cycle , such that . Now, we may let be the following hamiltonian path:
[TABLE]
A.87**.**
Lemma 2.12 tells us that
[TABLE]
Since inverts and centralizes , this implies
[TABLE]
A.88**.**
Lemma 2.12 tells us that the -transform multiplies the voltage by a conjugate of
[TABLE]
Since inverts , and , this is conjugate to .
A.89**.**
Let . We may let , where is a hamiltonian path from to in \operatorname{Cay}\bigl{(}\langle\widehat{S_{0}}\rangle;b,d\bigr{)}, such that (and contains at least one edge labeled ).
Here is one way to construct such a hamiltonian path. We know that (since for all and ). On the other hand, (from the choice of and ). So corollary 3.8 tells us that is even. (In fact, is even.) Therefore, we may let be a hamiltonian path of the following shape:
[TABLE]
A.90**.**
Lemma 2.12 tells us that the voltage is multiplied by a conjugate of
[TABLE]
A.91**.**
Let be a hamiltonian path in , such that . Then the desired hamiltonian cycle is .
A.92**.**
Lemma 2.12 tells us that the voltage is multiplied by a conjugate of
[TABLE]
since inverts .
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1]
- 2[2] K. Bannai: Hamiltonian cycles in generalized Petersen graphs, J. Comb. Th. B 24 (1978) 181–188. MR 0505806 http://dx.doi.org/10.1016/0095-8956(78)90019-9 · doi ↗
- 3[3] C. C. Chen and N. F. Quimpo: On strongly Hamiltonian abelian group graphs, in K. L. Mc Avaney, ed., Combinatorial Mathematics, VIII ( Geelong, 1980 ) , pp. 23–34. Lecture Notes in Math., 884, Springer, Berlin-New York, 1981. MR 0641233 http://dx.doi.org/10.1007/B Fb 0091805 · doi ↗
- 4[4] S. J. Curran, D. W. Morris, and J. Morris: Cayley graphs of order 16 p 16 𝑝 16p are hamiltonian, Ars Math. Contemp. 5 (2012) 185–211. MR 2912833 http://amc-journal.eu/index.php/amc/article/view/207
- 5[5] E. Durnberger: Connected Cayley graphs of semi-direct products of cyclic groups of prime order by abelian groups are Hamiltonian, Discrete Math. 46 (1983), no. 1, 55–68. MR 0708162 http://dx.doi.org/10.1016/0012-365X(83)90270-4 · doi ↗
- 6[6] E. Durnberger: Every connected Cayley graph of a group with prime order commutator group has a Hamilton cycle, in: B. Alspach and C. Godsil, eds., Cycles in Graphs ( Burnaby, B.C., 1982 ) , North-Holland, Amsterdam, 1985, pp. 75–80. MR 0821506 http://dx.doi.org/10.1016/S 0304-0208(08)72997-9 · doi ↗
- 7[7] E. Ghaderpour and D. W. Morris: Cayley graphs of order 27 p 27 𝑝 27p are hamiltonian, Internat. J. Comb. 2011 (2011), Article ID 206930, 16 pages. MR 2822405 http://dx.doi.org/10.1155/2011/206930 · doi ↗
- 8[8] E. Ghaderpour and D. W. Morris: Cayley graphs of order 30 p 30 𝑝 30p are hamiltonian, Discrete Math. 312 (2012) 3614–3625. MR 297949 http://dx.doi.org/10.1016/j.disc.2012.08.017 · doi ↗
