Hamiltonicity in generalized quasi-dihedral groups ††thanks: Key Words: Cayley graphs, Hamiltonian double rays, Infinite graph, Infinite groups ††thanks: Mathematics Subject Classification 2010: 05C25, 05C45, 05C63, 20E06, 20F05.
Abstract
Witte Morris showed in [21] that every connected Cayley graph of a finite (generalized) dihedral group has a Hamiltonian path. The infinite dihedral group is defined as the free product with amalgamation . We show that every connected Cayley graph of the infinite dihedral group has both a Hamiltonian double ray, and extend this result to all two-ended generalized quasi-dihedral groups.
1 Introduction
A Hamiltonian cycle(path) in a finite graph is a cycle(path) which includes every vertex of the graph. A graph is vertex-transitive if any two vertices and of , there is some automorphism such that . The Lovász conjecture for vertex-transitive graphs states that every finite connected vertex-transitive graph contains a Hamiltonian cycle except five known counterexamples. Nevertheless, even the weaker version of the conjecture for finite Cayley graphs is still wide open. For a survey on the field, see [20, 11]. A dihedral group is the group of symmetries of a regular polygon, which includes rotations and reflections. Witte showed in [21] that every connected Cayley graph of a finite (generalized) dihedral group has a Hamiltonian path. It is worth mentioning that the existence of a Hamiltonian cycle in a dihedral group is still not known.
While all preceding results concerned finite graphs, Hamiltonian cycles (paths) have also been considered in infinite graphs. One can suggest the Hamiltonian ray as a generalisation to an infinite graph for the Hamiltonian path, however the correct infinite analogue of a Hamiltonian cycle is controversial. The first thing coming to mind is a spanning double-ray, an infinite connected graph in which each vertex has degree two, which we will refer to as a Hamiltonian double-ray.
It is an easy observation to see that the Lovász conjecture already fails for infinite Cayley graphs with Hamiltonian double-rays in place of Hamiltonian cycles, since the amalgamation of more than groups on a subgroup of order will produce groups with Cayley graphs that have separators of size whose removal leaves more than components, a well-known obstruction to Hamiltonicity (see [10]).
This obstruction practically ceases to exist for two-ended groups though. It was proven in [13, 16] that any Cayley graph of an abelian two-ended group contains a Hamiltonian double ray. In particular, the following has been conjectured.
Conjecture 1 ([12]).
Any Cayley graph of a group with at most two ends has a Hamiltonian double ray.
In this paper, we address the result of Witte [21] for infinite dihedral groups as well as dihedral groups and we make progress towards Conjecture 1. Our main result is the following
Theorem 1.1.
Let be a two-ended generalized quasi-dihedral group. Then contains a Hamiltonian double ray.
The following Corollary is an immediate consequence of Theorem 1.1.
Corollary 1.2.
Every connected Cayley graph of the infinite dihedral group has a Hamiltonian double ray.
Our proof relies on extracting infinite two-ended grids or infinite two-ended cubic “cylindrical walls” (the precise definition of which we defer to Section 4) as spanning subgraphs of the Cayley graph. We prove that they, in turn, contain Hamiltonian double rays and circles.
2 Preliminaries
We start with the definition of generalized dihedral groups. The generalized dihedral group on an abelian subgroup is the group . Alternatively, it is the external semidirect product , where is abelian and for any , in additive notation. When , we obtain the infinite dihedral group . Note that an alternative presentation of is . Next, we extend this definition to a more general setting.
Definition 1.
Let be a group with an abelian subgroup of index . Then is called generalized quasi-dihedral (on and ) if has the presentation .
Clearly, every generalized dihedral group is generalized quasi-dihedral but not the other way around, as easily shows for example. Furthermore if , then our notation leads to generalized dicyclic groups.
Let and be two groups. Suppose that a subgroup of is isomorphic to a subgroup of , say an isomorphic map . The free product with amalgamation of and over is
For more details and applications of free products with amalgamation, see [15].
Lemma 2.1.
[3, Theorem 11.3] Let and be two groups with isomorphic subgroups and respectively. Let be a left transversal111A transversal is a system of representatives of left cosets of in and we always assume that belongs to it. of for . Any element can be uniquely written in the form with the following:
-
(i)
.
-
(ii)
or for and the consecutive terms and lie in distinct transversals.
A graph is called locally finite if every vertex has finite degree. A ray in a graph is a oneway infinite path, and an end of a locally finite graph is an equivalence class of rays under the relation if for every finite set of vertices , all but finitely many vertices of and lie on the same component of .
Let be a finitely generated group. Let be a finite generating set of and let be the Cayley graph of with respect to . The number of ends of is defined as the number of ends of . A basic fact in the theory of ends for groups says that the number of ends of does not depend on the choice of a finite generating set of , so that it is well-defined, see Corollary 2.3 of [14]. We finish this section with the following theorem:
Theorem 2.2.
[14, Theorem 1.1] Let be a two-ended group with a finite normal subgroup . Then the following statements are equivalent:
-
(i)
.
-
(ii)
.
3 The structure of GQD groups
We start with the following lemma which is immediate by the definition of a generalized quasi-dihedral group.
Lemma 3.1.
Let be a generalized quasi-dihedral on and . Then the following statements hold:
-
(i)
, for every and .
-
(ii)
If with finite order, then is generalized quasi-dihedral on and , and moreover .
-
(iii)
Every subgroup of is normal in
Proof.
-
(i)
Let . Then .
-
(ii)
Since the order of is finite, the first part implies that is generalized quasi-dihedral on and . Moreover, for the element we have by Definition 1 that , or equivalently .
-
(iii)
This part is a direct consequence of the first part.∎
By Lemma 3.1, we will say that is generalized quasi-dihedral just on when we don’t want to fix a specific generator with finite order outside of .
Lemma 3.2.
[21, Theorem 5.1] If a finite group has a subgroup of index 2 such that every subgroup of is normal in , then every Cayley graph of has a Hamiltonian path.
Corollary 3.3.
Let be a finite generalized quasi-dihedral group. Then every Cayley graph of has a Hamiltonian path.∎
Our ultimate goal is to extend the above result to infinite generalized quasi-dihedral groups. But first we need to study some properties of infinite generalized quasi-dihedral groups.
We start with study of two-ended groups. The following result seems to be folklore, but unfortunately we could not find any reference for it, so we include a short proof for the sake of completeness.
Lemma 3.4.
Let be a -ended group. Then is normal in .
Proof.
Since the index of is in both and , we may assume the presentations and , where and . By the definition of the free product with amalgamation we know that has the following presentation:
where and . We note that the index of in and is two and so is normal in and . Therefore, lies in for every and thus also for every . ∎
Lemma 3.5.
Let , where and . Then the following statements hold:
-
(i)
-
(ii)
for every .
-
(iii)
.
-
(iv)
is torsion if and only if or , where and .
-
(v)
is not torsion if and only if , where and .
Proof.
-
(i)
The first part follows from Lemma 2.1 that .
-
(ii)
We note that and both lie in . Hence we have and so and a straightforward induction finishes this part.
-
(iii)
The second part with the help of Lemma 2.1 implies the third item.
Next we prove (iv) and (v) together. Assume that is an arbitrary element in . By the last part, we deduce that is either or . We first let . Then we have
(1) | ||||
(2) | ||||
We note that we apply the second item on (1) in order to get (2). So we showed that lies in and so has finite order.
Next assume to contrary that , where and so . Without loss of generality we assume that is the smallest number with this property. By considering Lemma 2.1, we deduce that . Since is a finite subgroup, we infer that is finite and it yields a contradiction.∎
Lemma 3.6.
[18, 3.3.15] Let be a group with a subgroup of finite index. Then there exists a normal subgroup of such that .
For the remainder of the paper, when not stated otherwise will denote an infinite generalized quasi-dihedral group , where is generalized quasi-dihedral on and , is generalized quasi-dihedral on and , and . As a result of Lemma 3.10, we see that for every we have .
Pretty much the same computation shows that for every and generator . We obtain the following.
Corollary 3.7.
Let . If , then . ∎
Lemma 3.8.
[17, Lemma 5.6] Let be a subgroup of finite index in . Then the number of ends of is the same as the number of ends of .
Theorem 3.9.
Let be a two-ended group. Then if is generalized quasi-dihedral, then and are generalized quasi-dihedral on .
Proof.
First we assume that is a generalized quasi-dihedral group on and and so . Since is generated by and and also the order of is finite, we infer that . It follows from Lemma 3.8 that is a two-ended abelian group. So must be isomorphic to , where is a finite abelian group. We note that is only a finite subgroup of and so it must be a characteristic subgroup of . On the other hand is a normal subgroup and we conclude that is a normal subgroup in , see Theorem 6.14 of [19]. We now have
(3) | ||||
(4) |
We know lies in and so . It follows from Theorem 2.2 that the group can written as , where .
Finally, we show that is a generalized quasi-dihedral on . We note that and so for . The rest follows from the relation . Similarly, one can show that is also generalized quasi-dihedral. ∎
Lemma 3.10.
Let be a generalized quasi-dihedral groups such that and . Then the following are true:
-
(i)
-
(ii)
.
-
(iii)
and .
-
(iv)
for every .
-
(v)
Proof.
It follows from Theorem 3.9 that , where and is a finite abelian group. ∎
It is well-known that every subgroup of a finite dihedral group is either cyclic or dihedral. It is seeminlgy folklore that this property translates to the infinite dihedral group as well, but we couldn’t find a reference for it.
Theorem 3.11.
Let be a generalized quasi-dihedral group on and . Let be a subgroup of . Then either is abelian or generalized quasi-dihedral. In particular, every subgroup of infinite dihedral group is either cyclic or infinite dihedral.
Proof.
If is a subgroup of , then is abelian and we are done. Assume that , then . Since , one can see that there is a such that and . Then for every , we have that . Next we have to show that the order of is finite. Note that and so . Since is a generalized quasi-dihedral group on and , we know that the order is finite. So is a generalized quasi-dihedral group on and , as desired. ∎
3.1 Short cycles in Cayley graphs of two-ended generalized quasi-dihedral groups
In this subsection, we prove some crucial facts about - and -cycles in the Cayley graphs of two-ended generalized quasi-dihedral groups. Recall that by Corollary 3.5, where .
Theorem 3.12.
Let and let be three distinct elements in . Then . If in particular, then for every the sequence of vertices is a -cycle in .
Proof.
Theorem 3.13.
Let and let , . Then, . If , in particular, then the sequence of vertices is a -cycle in .
4 Grids, Walls and Cylinders
As we already mentioned in the Introduction, the proof of Theorem 1.1 is based on extracting grids and cylindrical walls as spanning subgraphs. In this short section, we discuss the Hamiltonicity of the grid-like structures.
The Cartesian product of two graphs and is the graph with vertex set , where vertices and are adjacent whenever and , or and .
Let denote the path graph on vertices and the double ray graph. The (two-ended) infinite grid of height is the graph . The next lemma provides a way to extract a spanning grid and, consequently, a Hamiltonian double ray from a graph.
Lemma 4.1.
[12, Lemma 3.9] Let be two-ended locally finite graphs and let be disjoint subgraphs of such that
-
(i)
, and
-
(ii)
every contains a spanning subgraph , which is isomorphic to by means of an isomorphism , and
-
(iii)
for every and every there is an edge between and .
Let be a spanning double ray of . Then contains a spanning infinite grid of height . In particular, it contains a Hamiltonian double ray and a Hamiltonian circle.
The wall graph of height is the graph with vertex set and edge set , where
For even, the twisted cubic cylinder of height and twist is the graph with vertex set and edge set , where
-
•
, when is even,
-
•
, when is odd.
The edges in are called straight and the edges in are called twisted. The -th row of and is the double ray induced by . For , the -th block of length of is the graph induced by the vertices
-
•
, , , when is even. The -th snake of length is then the unique Hamiltonian path from to in .
-
•
, , , when is odd. The -th snake of length is then the unique Hamiltonian path from to in .
In particular, the -th column of is the path .
The -th staircase of is the unique path of length from to .
The following lemma captures a surprising property of twisted cylinders: stretching a given twisted cylinder along carefully chosen double rays can transform it into a twisted cylinder with different parameters (see Fig. 2).
Lemma 4.2.
For any and with even, the twisted cylinders and are isomorphic.
Proof.
For , let be the double ray obtained by the concatenation of the all staircases along twisted edges. We observe that is isomorphic to with rows . ∎
Lemma 4.3.
For any and with even, the twisted cubic cylinder contains a Hamiltonian double ray.
Proof.
If and are even , we obtain a Hamiltonian double ray by concatenating all snakes , along twisted edges.
If and are odd , let be positive even numbers such that . We then obtain a Hamiltonian double ray by concatenating all snakes and , in an alternating fashion along twisted edges.
It remains to check the cases when (and necessarily even) or (and odd). For , let be the double ray obtained by the concatenation of the all staircases along twisted edges. We conclude the proof by invoking Lemma 4.2 and noticing that . ∎
Lemma 4.4.
For any and , the twisted cubic cylinder contains a disjoint union of two double-rays which together span .
Proof.
We can assume that , as otherwise the result is trivial for . Moreover, we reduce the cases where to the next (general) cases by invoking Lemma 4.2.
If and are even , let be positive even integers such that . We let be the double ray obtained by the concatenation of all snakes and the double ray obtained by the concatenation of all snakes , along twisted edges as the two disjoint double rays that span a Hamiltonian circle of .
If and are odd , let be positive even numbers such that . As before, we define the double ray as the concatenation of all snakes and , in an alternating fashion along twisted edges and as the concatenation of all , . The double rays and are then disjoint and span a Hamiltonian circle. ∎
5 Proof of the main Theorem
Let us quickly remind the following basic fact.
Lemma 5.1.
(Modular law)[18, 1.6.15] If is a group, is a subset of , and is a subset of , then .
Lemma 5.2.
Let be an arbitrary group (not necessarily finite) with a subgroup of index . Then if , then generates , where .
Proof.
Let be an arbitrary element of . Then , where each for . We note that must be even in order for to lie in . This proves that generates . Finally, we show that every element of can be generated by by noting that and . This completes the proof. ∎
We are ready to prove our main result. We will extensively use Definition 1 and Lemma 3.10 for the calculations throughout the proof, so we will mostly not specifically refer to them each time we use them.
Proof of Theorem 1.1.
Let with , and . We apply induction on the number of generators in . For the base case that , we immediately see that is a double ray (and it is straightforward to show that ). We split the proof of the induction step into two cases.
Case I . We first assume that . Let and define , where . We claim that
there is always an such that is infinite. | (5) |
Suppose not; by Lemma 3.5 every generator in has the form and let . Notice that the element has finite order. By Lemma 3.5 we conclude that . Otherwise is not torsion. Since generates , we infer that , where . Therefore, the group is infinite, as is not torsion. So the claim is proved.
Thus, we can always assume that is infinite. In particular, we have and so . We infer that , where and for some , as is not commutative. In particular is a normal in
We now state the following calculation, some steps of which we explain afterwards:
(6) | ||||
(by Lemma 5.1) | ||||
(7) |
Let and . For (6), we first note that . Because assume that and so . In addition, we have
So commutes with and and similarly one can show that commutes with and as well. So is a subgroup of .
Let .
We have proven so far that ,
so it remains to show (7) which means that .
It is not hard to see that .
One can see that and so implies that .
We can now apply Lemma 5.2 and infer that generates .
On the other hand, we know that and so .
We claim that
and can be expressed as , where . | (8) |
Observe that . Moreover, notice that that , and lie in , hence they pairwise commute. Since , we deduce that
and
So the claim is proved. Hence, we have shown that every coset of in is of the form . Observe that has finite index in , therefore we have
Recall that . Therefore, the cosets of partition as follows:
(9) | ||||
We need a final observation. It is an easy induction on to see that for every and (not necessarily distinct) we have that
(10) | ||||
(11) |
We are ready to extract a spanning twisted cubic cylinder from . Recall that has a spanning double ray , which must necessarily alternate between the two cosets of in by the fact that . Split into subpaths of length two between vertices of and let be an arbitrary such subpath, where . By Theorem 3.12, there is a -cycle . In other words, is obtained by connecting the ends of and with two edges labeled with . Clearly, and by (11) we have that . It follows that the concatenation of all such paths of length two gives rise to a spanning double ray of alternating between vertices of and , where the vertices of in are connected by an -edge to the vertices of in .
Using exactly the same method, we obtain inductively for every that has a spanning double ray alternating between and , where the vertices of in are connected by an -edge to the vertices of in . This gives rise to a twisted cubic cylinder with rows to conclude by Lemma 4.3 and Lemma 4.4 that contains a Hamiltonian double ray.
Case II .
Suppose that . Let (notice that ) and .
Let be the subgroup generated by .
Subcase i: If is finite, then .
Let and .
By Theorem 3.13, we have
and also .
We note that and so is generalized quasi-dihedral.
By the induction hypothesis the Cayley graph of with respect with has a Hamiltonian double ray
where for each .
On the other hand, has a Hamiltonian path.
Since we showed that and , we invoke Lemma 4.1 and conclude that has a Hamiltonian double ray.
Subcase ii: If is infinite, then is finite.
We note that is an abelian group and so it follows from [16, Theorem 1] that contains a Hamiltonian double ray .
By Corollary 3.7 we know that is normal and moreover generates the quotient .
On the other hand, we know by Lemma 3.10 that is an abelian subgroup of .
Furthermore, we have that .
Since for every and is finite, we deduce that the quotient is a generalized quasi-dihedral group on and .
It follows from Corollary 3.3 that has a Hamiltonian path
Observe that contains a Hamiltonian double ray for every in . Moreover, the vertices of are connected to the vertices of with a perfect matching whose edges are labeled with the same generator . In combination with Lemma 3.13, this implies that conditions (ii) and (iii) of Lemma 4.1 hold and we are done. ∎
6 Final Remarks
In the final chapter, we illustrate different approaches to continue the study of Hamiltonicity of generalized quasi-dihedral groups.
6.1 Hamiltonian circles
While there have been many attempts to extend the definition of hamiltonian cycles for infinite graphs, there is no single method that generalizes all theorems of finite Hamiltonicity to locally finite graphs.
Here we follow the topolgical approach introduced in [6, 7, 8]. More specifically, the infinite cycles of a graph are defined as the circles(homeomorphic image of ) in the Freudenthal compactification , where denotes the graph endowed by -complex topology. A homeomorphic image of in is an arc in . A circle in is a Hamiltonian circle if it contains all vertices of . When is two-ended, there is a nice combinatorial description for Hamiltonian circles, see the following lemma.
Lemma 6.1.
[7, Theorem 2.5] If is a locally finite, two-ended graph and is a disjoint union of two double-rays which together span , each of which contains a ray to both ends of the graph, then is a Hamiltonian circle.∎
Corollary 6.2.
Let be a two-ended generalized quasi-dihedral group. If has degree at least three, it contains a Hamiltonian circle.
We believe that the same statements of Hamiltonicity go through when is a one-ended generalized quasi-dihedral group, too. We note that in that case the subrgroup of of index is an abelian one-ended group, hence is isomorphic to for some .
Conjecture 2.
Let be a one-ended generalized quasi-dihedral group. Then contains a Hamiltonian double ray(Hamiltonian circle).
6.2 Hamilton-connectivity
A finite graph is called Hamilton-connected if there is a Hamiltonian path between any pair of vertices of the graph. A finite bipartite graph is called Hamilton-laceable if there is Hamiltonian path between pair of vertices at odd distance. It is an easy observation that Hamilton-laceability (and not -connectivity) is the most that one can hope for in the case of finite bipartite graphs. The most celebrated theorem relating Cayley graphs and Hamilton-connectivity is due to Chen and Quimpo [4], who proved something stronger about the Hamiltonicity of Cayley graphs of finite abelian groups with degree at least three; they are actually Hamilton-connected, unless they are bipartite when they are Hamilton-laceable.
Alspach et al. prove in [1] extended this for Cayley graphs of finite generalized dihedral groups with degree at least three. Their proof also relies on extracting spanning finite versions of infinite two-ended grids or twisted cubic cylinders —defined as honeycomb toroidal graphs in [1]—, where the double rays of the rows are replaced with finite cycles. A large part of their paper revolves around proving that these finite graphs are Hamilton-connected or -laceable.
Notice that from the definition of Hamiltonian connectivity we immediately obtain a Hamiltonian cycle when the two endvertices are connected with an edge. Using this, let us generalize the notion of Hamilton-connectivity to the infinite setting. We say an infinite (bipartite) graph is Hamiltonian ray-connected (-laceable) if for any pair of vertices (at odd distance) there are two disjoint rays starting from spanning all the vertices of the graph. Similarly, an infinite (bipartite) graph is Hamiltonian arc-connected (-laceable) if for any pair of vertices (at odd distance) there are two rays starting from and a double ray, all pairwise disjoint, whose union spans all the vertices of the graph. Observe that when and are connected with an edge in both definitions, we directly obtain a Hamiltonian double ray and a Hamiltonian circle, respectively.
The fact that bipartite graphs can only be Hamilton-laceable fails for infinite graphs. It is very easy (but a bit tedious as well) to prove that two-ended infinite grids are not just Hamilton-laceable, but Hamilton-connected.
Problem 1.
Is (G,S) both Hamiltonian ray- and arc-connected, where is a generalized quasi-dihedral group?
6.3 Decomposition and Uniqueness
Alspach, in [2, Unsolved Problem 4.5, p. 454]] conjectured the following. Let be an Abelian group with a symmetric generating set . If the Cayley graph has no loops, then it can be decomposed into Hamiltonian cycles (plus a -factor if the valency is odd) and see [5], for a directed version of this problem, Erde and Lehner [9] showed every 4-regular Cayley graph of an infinite abelian group all of whose finite cuts are even can be decomposed into Hamiltonian double rays, and so characterised when such decompositions exist. It raises the following question.
Problem 2.
Can every -regular Cayley graph of two-ended generalized quasi-dihedral group be decomposed into two hamiltonian double-rays(Hamiltonian circle)?
Finally, consider . The Cayley graph of with respect to contains a unique Hamiltonian circle. Naturally, we ask the following question.
Problem 3.
Let be a generalized quasi-dihedral group. For which generating of does contain a unique Hamiltonian circle?
References
- [1] Brian Alspach, Chuan Chong Chen, and Matthew Dean. Hamilton paths in Cayley graphs on generalized dihedral groups. Ars Math. Contemp., 3(1):29–47, 2010. https://doi.org/10.26493/1855-3974.101.a37.
- [2] Brian Alspach and Chris Godsil, editors. Cycles in Graphs. North-Holland Publishing Co., Amsterdam, 1985. https://www.elsevier.com/books/cycles-in-graphs/alspach/978-0-444-87803-8.
- [3] Oleg Bogopolski. Introduction to group theory. EMS Textbooks in Mathematics. European Mathematical Society (EMS), Zürich, 2008. https://doi.org/10.4171/041.
- [4] Chuan Chong Chen and Norman F. Quimpo. On strongly Hamiltonian abelian group graphs. 884:23–34, 1981. https://doi.org/10.1007/bfb0091805.
- [5] Iren Darijani, Babak Miraftab, and Dave Morris. Arc-disjoint hamiltonian paths in Cartesian products of directed cycles, 2022. https://arxiv.org/pdf/2203.11017 (preprint).
- [6] Reinhard Diestel. Locally finite graphs with ends: a topological approach, II. Applications. Discrete Math., 310(20):2750–2765, 2010. https://doi.org/10.1016/j.disc.2010.05.027.
- [7] Reinhard Diestel. Locally finite graphs with ends: a topological approach, I. Basic theory. Discrete Math., 311(15):1423–1447, 2011. https://doi.org/10.1016/j.disc.2010.05.023.
- [8] Reinhard Diestel. Graph theory, volume 173 of Graduate Texts in Mathematics. Springer, Berlin, fifth edition, 2018.
- [9] Joshua Erde and Florian Lehner. Hamiltonian decompositions of 4-regular Cayley graphs of infinite abelian groups, 2020. https://arxiv.org/abs/2006.09759 (preprint).
- [10] Agelos Georgakopoulos. Infinite Hamilton cycles in squares of locally finite graphs. Adv. Math., 220(3):670–705, 2009. https://doi.org/10.1016/j.aim.2008.09.014.
- [11] Ganhewalage Jayantha Lanel et al. A survey on hamiltonicity in Cayley graphs and digraphs on different groups. Discrete Math. Algorithms Appl., 11(5):Article ID 1930002, 2019. https://doi.org/10.1142/s1793830919300029.
- [12] B. Miraftab and T. Rühmann. From cycles to circles in Cayley graphs. arXiv preprint arXiv:1708.03476, 2017.
- [13] Babak Miraftab and Tim Rühmann. Hamilton circles in Cayley graphs. Electron. J. Combin., 25(2):Paper No. 2.5, 17, 2018. https://doi.org/10.37236/7009.
- [14] Babak Miraftab and Tim Rühmann. Two-ended quasi-transitive graphs. Discrete Mathematics, Algorithms and Applications, 2021, in press. https://doi.org/10.1142/S1793830922500239.
- [15] Babak Miraftab and Konstantinos Stavropoulos. Splitting groups with cubic Cayley graphs of connectivity two. Algebr. Comb., 4(6):971–987, 2021. https://doi.org/10.5802/alco.
- [16] C. St. J. A. Nash-Williams. Abelian groups, graphs and generalized knights. Proc. Cambridge Philos. Soc., 55:232–238, 1959. https://doi.org/10.1017/s0305004100033946.
- [17] Peter Scott and Terry Wall. Topological methods in group theory. In Homological group theory (Proc. Sympos., Durham, 1977), volume 36 of London Math. Soc. Lecture Note Ser., pages 137–203. Cambridge Univ. Press, Cambridge-New York, 1979. https://doi.org/10.1017/cbo9781107325449.007.
- [18] William R Scott. Group Theory. Prentice-Hall, Englewood Cliffs, NJ, 1964.
- [19] Michio Suzuki. Group Theory, volume 247. Springer-Verlag, 1982. https://doi.org/10.1007/978-3-642-61804-8.
- [20] David Witte and Joseph A. Gallian. A survey: Hamiltonian cycles in Cayley graphs. Discrete Math., 51(3):293–304, 1984. https://doi.org/10.1016/0012-365X(84)90010-4.
- [21] David S. Witte. On Hamiltonian circuits in Cayley diagrams. Discrete Math., 38(1):99–108, 1982. https://doi.org/10.1016/0012-365X(82)90174-1.