On π -Product Involution Graphs in Symmetric Groups

Suppose that G is a group, X a subset of G and π a set of natural numbers. The π -product graph P π ( G , X ) has X as its vertex set and distinct vertices are joined byanedgeiftheorderoftheirproductisin π .If X isasetofinvolutions,then P π ( G , X ) is called a π -product involution graph. In this paper we study the connectivity and diameters of P π ( G , X ) when G is a ﬁnite symmetric group and X is a G -conjugacy class of involutions.


Introduction
There is a cornucopia of combinatorial and geometric structures which are associated with groups. These range from graphs to posets and topological spaces such as simplicial complexes. An example of the latter type arises in a finite group G where for a prime p dividing the order of G we may define the poset of all non-trivial p-subgroups of G, denoted S p (G), ordered by inclusion. This poset has a rich structure, as has its The second author's research is supported by a University of Manchester Faculty of Engineering and Physical Sciences Deans Award. associated order complex |S p (G)| known as the Brown complex, after being studied by-among others-Brown in his paper [10]. An analogous order complex, called the Quillen complex, can be defined for the poset A p (G) of all non-trivial elementary abelian p-subgroups of G. Indeed, Quillen showed in [16] that the Brown and Quillen complexes are G-homotopy equivalent. Thévenez and Webb later showed that the complexes consisting of chains of normal series of p-subgroups, and chains of radical p-subgroups are also G-homotopy equivalent to the Brown and Quillen complexes (see [19,20] for full details). In the case when G is a group of Lie type, the order complex |S p (G)| is the same as the building of G. A good survey of the versatility of such complexes can be found in [18].
We mention a few graphs among the multitude of such structures that we may associate to a given group G. Let X be a subset of G. The commuting graph C(G, X ) has vertex set X and distinct elements x, y ∈ X are joined by an edge whenever x y = yx. The case when X = G\Z (G), first studied in [8], has been the focus of interest recently-see [9,13,14]. When X is taken to be a G-conjugacy class of involutions, we get the so-called commuting involution graph, the subject of a number of papers (see [1][2][3][4]12,15,17]).
If π is a set of natural numbers, then the π -product graph P π (G, X ) again has vertex set X , with distinct vertices x, y ∈ X joined by an edge if the order of x y is in π . In the case when X is a G-conjugacy class of involutions, we note that P {2} (G, X ) is just a commuting involution graph. Taking π to be the set of all odd natural numbers and X a G-conjugacy class, P π (G, X ) becomes the local fusion graph F(G, X ) which has featured in [5,6].
In the case when X is a set of involutions we refer to P π (G, X ) as a π -product involution graph. It is such graphs when X is a conjugacy class that we consider in this paper for G = Sym(n), the symmetric group of degree n. We use the standard distance metric on P π (G, X ), which we denote by d(·, ·). For x ∈ X and i ∈ N we denote the set of vertices distance i from x in P π (G, X ) by Δ i (x). We also denote by Ω := {1, . . . , n} the underlying set upon which Sym(n) acts.
We first consider the case when π = {4}. Or, in other words, two distinct involutions x, y ∈ X are joined by an edge whenever x, y ∼ = Dih (8), the dihedral group of order 8. In considering this, we are in effect looking at a section of the poset S 2 (Sym(n)). Our first result determines when P {4} (G, X ) is connected and in such cases, the diameter of P {4} (G, X ) is also determined.
Theorem 1 Suppose G = Sym(n), t = (1, 2) · · · (2m −1, 2m) ∈ G, and let X denote the G-conjugacy class of t. For symmetric groups, the diameters of the connected π -product involution graphs have been determined when π = {2}-that is the commuting involution graphsand π = N odd (=the set of all odd natural numbers)-the local fusion graphs. In the former case the diameter is bounded above by 3 except for three small cases when the diameter is 4. Moreover, the diameter can be 3 infinitely often. In the latter case, the connected local fusion graphs for symmetric groups always have diameter 2. So, from this perspective, P π (G, X ) for π = {4} and π = N odd are bed fellows. However, this apparent similarity does not extend to the case that π = {2 a } for some a ≥ 3. Indeed, we shall derive the following result.
Theorem 2 Suppose that G = Sym(n), 2m = 2 a ≤ n for some a ≥ 3, t = (1, 2)(3, 4) · · · (2m − 1, 2m) and X is the G-conjugacy class of t. Then (where x denotes the smallest integer greater than or equal to x). Taking n = 4m in this theorem gives an infinite family of π -product involution graphs whose diameter is unbounded.
Specializing to the case m = 4 (so 2m = 8) we can give precise values for the diameter of P {8} (G, X ) in our next theorem.  An analogous version of Theorem 2 also holds for any odd prime power.

Theorem 4
Suppose that G = Sym(n), p is an odd prime and q = p a for some a ≥ 1. Let t = (1, 2) · · · (q − 2, q − 1) and X be the G-conjugacy class of t. Then Our final result combines Theorems 2 and 4.
This paper is arranged as follows. In Sect. 2 we introduce the notion of the x-graph of an element of X . These are graphs that encapsulate the C G (x)-orbits of X and were first introduced by Bates et al. [2]. We present a number of their results, and relate the connected components of an x-graph to the disc Δ 1 (t) for a fixed involution t of X . Sect. 3 begins by considering combinations of connected components of x-graphs, and we show that Theorem 1 holds when restricted to the supports of such components. In particular we consider the case when our conjugacy class consists of elements of full support in Lemma 10. We then proceed to give a general proof of Theorem 1 at the end of this section. The paper concludes in Sect. 4 with an analysis of π -product graphs when π = {4}. We begin by considering the case when π = {2 a } for some a ≥ 3. Calculations of the sizes of discs Δ i (t) for certain π -product involution graphs are given and these give a direct proof of Theorem 3. This is followed by constructive proofs of Theorems 2 and 4 and a proof of Theorem 5. Finally, we consider some smaller symmetric groups and calculate the sizes of discs of the π -product graphs P π (G, X ) when π = {6} or {8}.

Preliminary Results
Throughout this paper, we set G = Sym(n) and consider G as acting on a set of n letters (or points), Ω = {1, . . . , n}. Let t ∈ G be a fixed involution and let X be the G-conjugacy class of t. For an element g ∈ G, we denote the set of fixed points of g on Ω by fix(g) and define the support of g to be supp(g) := Ω\ fix(g). For the sake of brevity, if x 1 , x 2 , . . . , x r ∈ G we denote supp(x 1 ) ∪ supp(x 2 ) ∪ · · · ∪ supp(x r ) by supp(x 1 , x 2 , . . . , x r ).
To study the graph P {4} (G, X ), we first introduce another type of graph known as an x-graph. Indeed, let x ∈ X . The x-graph corresponding to x, denoted G x , has vertex set given by the orbits of Ω under t . Two vertices σ, γ are joined in G x if there exists σ 0 ∈ σ and γ 0 ∈ γ such that {σ 0 , γ 0 } is an orbit of Ω under x . We call the vertices corresponding to transpositions of t black vertices, denoted , and those corresponding to fixed points of t white vertices, denoted . As an example, let n = 15, t = (1, 2)(3, 4)(5, 6)(7, 8)(9, 10)(11, 12) and x = (1, 7)(2, 3)(4, 10)(8, 9)(11, 13) (12,14). The x-graph G x is given by We note that we could swap the roles of t and x to produce another x-graph which we denote by G x t . In general the x-graph G y x has vertices the orbits of Ω under y , and edges defined by the orbits of Ω under x .
The concepts of x-graphs were first introduced in [2] as a tool for studying the commuting involution graphs of the symmetric groups. More recently they have also been used in the study of local fusion graphs for the symmetric groups (see [6] for further details). The versatility of x-graphs in calculations arises from the simple observation that each black vertex has valency at most two and each white vertex has valency at most one. Consequently, we may fully determine the possible connected components of a given x-graph.
In the subsequent discussion, we will consider x-graphs up to isomorphism. It is implicit that such an isomorphism will preserve vertex colours. We also fix t = (1, 2) · · · (2m − 1, 2m) ∈ G.
Bates, Bundy, Perkins and Rowley's interest in x-graphs stemmed from the following elementary result. Part (i) of Lemma 2 is of particular interest, as it confirms that when employing a combinatorial approach using the connected components of x-graphs, we must consider all possible connected components given in Lemma 1. This approach will be used repeatedly in the proof of Theorem 1.
An immediate consequence of the definition of G x is that the number of black vertices is equal to the number of edges. Consequently the number of connected components of the form containing at least one black vertex must be equal to the number of connected components of the form and . Lemma 1 allows a combinatorial approach to be used when considering conjugate involutions. Indeed, given a connected component C i of G x , we may define Ω i to be the union of all vertices of C i . We may then define the i-part of t, denoted t i , to be the product of those transpositions of t that occur in Sym(Ω i ). We define x i similarly. By analysing the structure of the connected components given in Lemma 1 it is possible to relate the order of t x to the x-graph G x .

Lemma 3
Suppose that x ∈ X and that C 1 , . . . , C k are the connected components of G x . Denote the number of black vertices, white vertices and cycles in C i by b i , w i and c i respectively. Then (i) the order of t x is the least common multiple of the orders of t i x i (for i = 1, . . . , k); and Proof See Proposition 2.2 of [2].
We have the following immediate corollary to Lemmas 1 and 3. We conclude this section by noting that we can define an x-graph for any two (notnecessarily conjugate) involutions. This we will do frequently in Sect. 3. However, in such a situation it is no longer the case that the number of edges of G x is equal to the number of black vertices.

Proof of Theorem 1
In this section, we prove Theorem 1. Note that for m ≥ 2 and t = (1, 2) · · · (2m − 1, 2m), the involution x = (1, 3)(2, 4)(5, 6) · · · (2m − 1, 2m) ∈ X satisfies d(t, x) ≥ 2. Thus it suffices to prove when P {4} (G, X ) is connected, that for all x ∈ X we have d(t, x) ≤ 2. To do this we consider pairs or triples of connected components C i , C j and C k of G x and the corresponding parts We begin by proving a few preliminary results, dealing with the case n = 2m.

Lemma 4
Let m ≥ 5, n = 2m and suppose that x ∈ X is such that G x is connected. Then there exists y ∈ X such that d(t, y) = d(y, x) = 1.
The exact nature of the associated x-graphs is dependent on the parity of m. If m is even, then G y is given by and G y x is given by If m is odd, the graphs G y and G y x are, respectively and In all cases, the given graphs satisfy the conditions of Corollary 1, whence d(t, y) = d(y, x) = 1.
The proof of Lemma 4 illustrates a general feature that the actual x-graphs constructed may vary depending on the parity and values of the given parameters (such as the parameter m above). However, in using Corollary 1 we are only interested in the connected components of the x-graph. Thus for the sake of brevity, in all future proofs we will only describe the connected components of each x-graph.
Lemma 5 Suppose that m = 3, n = 6 and x ∈ X. If G x is connected, then there exists y ∈ X such that the x-graphs G y and G y x are isomorphic to Proof Without loss of generality, we may assume that x = (1, 6)(2, 3)(4, 5). Then y = (1, 2)(3, 6)(4, 5) is the required element. Proof We consider three separate cases. First assume that G x contains at least two components, C i and C j , of the form . Without loss, we may take t i = (1, 2)(3, 4)(5, 6), t j = (7, 8)(9, 10)(11, 12), x i = (1, 6)(2, 3)(4, 5) and x j = (7, 12)(8, 9)(10, 11). Defining y i j ∈ Sym(supp(t i , t j , x i , x j )) to be Denote the remaining parts of t and x by t k and x k . Applying Lemmas 5 and 6 to t k and x k produces an element y k ∈ Sym(supp(t k , x k )) such that y := y i j y k is the desired element of X .
In the case that G x contains a unique component, C i , of the form , then there exists at least one component, say C j , of the form . Taking t 9) results in x-graphs G t i t j y i j and G y i j x i x j which are isomorphic to Denoting the remaining part of t by t k and setting y := y i j t k ∈ X we have that d(t, y) = d(y, x) = 1 as required.
Finally, assume that all connected components of G x are of the form and let C i and C j be two such components. Without loss of generality we have that ) and x j = (5, 7)(6, 8), and as above denote the remaining part of t by t k . Setting . Hence, y := y i j t k is our desired element of X .
Proof Let x ∈ X . If G x has connected components containing precisely 4 black vertices then we leave the parts of t and x corresponding to such components alone. We then apply Lemma 4 to any connected component containing at least 5 black vertices, and Lemma 5 to any connected component containing 3 black vertices to obtain the desired result. Otherwise all connected components have at most 3 black vertices. Applying Lemmas 6 and 7 to a pair of components containing a total of 4, 5 or 6 black vertices, Lemma 5 to any remaining connected components containing 3 black vertices, and leaving all other connected components invariant gives the result.
Before presenting the proof of Theorem 1 we give a further three intermediate results.
Lemma 8 Let x ∈ X . Suppose that G x has connected components C i and C j of the given forms. Then there exists , which is H -conjugate to t i t j and such that the connected components of the x-graphs G (with r ≥ 1 black vertices); and (v) C i and C j are both of the form (with q, r ≥ 1 black vertices respectively).
Proof For each case, without loss of generality we give explicit formulations of the t i and x i . For ease of notation, where parameters q and r have been defined we set v = 2(q + r ).
In case (i) assume that . We now consider three possibilities. If r = 0, then we may assume that x j = (2q + 1, 2q + 2) and we take Finally, if r > 1, then we assume that We see that the x-graph G t i t j y i j has connected components of the form , and-depending on the values of q and r -also and . Similarly G y i j x i x j has connected components of the form , and in some cases also and as required.
Then the permutation y i j gives the desired x-graphs. Indeed, G t i t j y i j has connected components of the form and , G y i j x i x j has components of the form and (with the black vertex omitted if q = 2) and both xgraphs may also have connected components of the form and depending on the value and parity of q.
Turning to (iv), if q = 1, then without loss of generality we have that , 7) if r = 1). When r = 1, define is our desired element. Indeed in this case G t i t j y i j has connected components of the form , and in addition to components of the form and/or (depending on the value of r ), whilst G y i j x i x j has components of the forms and in addition to components of the form and/or (depending on the value of r ).
If q > 1, then we define Our desired element is then It follows that the connected components of G x i x j has isomorphism type as required. If q > r = 1, then setting t i = (1, 2) · · · (2q − 1, 2q)(v + 1), t j = (2q + 1, 2q + 2)(v + 2), x i = (1)(2, 3) · · · (2q, v + 1) and x j = (2q + 1)(2q + 2, v + 2) we define Consequently G t i t j y i j has connected components of the form , and and/or (depending on the value of q), whilst G y i j x i x j has components of the form , and and/or . When r > 1 we may assume that t i = (1, 2) · · · (2q − 1, 2q)(v + 1), t j = (2q if q = r and if q = r . We see that G t i t j y i j has connected components , and in addition to for some values of q and r . The x-graph G y i j x i x j also has the desired properties having a component of the form , some components of the form and possibly also , and/or depending on the values of q and r and the parity of q − r . We note that in cases (ii) and (iv) above, t i t j and x i x j have different cycle types. This is a fact which we will utilise in the proof of Theorem 1 In a similar vein to Lemma 8 we next consider collections of three connected components simultaneously.
Lemma 9 Let x ∈ X . Suppose that G x has connected components C i , C j and C k of the given forms and define H := Sym(supp(t i , t j , t k , x i , x j , x k )). Then there exists y i jk ∈ H which is H -conjugate to t i t j t k and such that the connected components of the x-graphs G t i t j t k y i jk and G y i jk x i x j x k satisfy the conditions of Corollary 1: (i) C i , C j and C k are each of the form (having q, r, s ≥ 1 black vertices respectively); and (ii) C i : (with q ≥ 1 black vertices), C j : (with r ≥ 1 black vertices), C k : .
Proof We follow the approach of the proof of Lemma 8 and construct the appropriate t i and x i . We also set v = 2(q + r ) and w = 2(q + r + s).

and so setting
whilst if q > 2 we take Consequently, the x-graph G t i t j t k y i jk has connected components and and possibly also , , and . Meanwhile, G y i jk x i x j x k has connected components , and and in some cases also and/or .
In this case, we set y = (1)(2, 3)(4)(5, 6)(7, 8)(9) · · · (n). In all cases we have that G y has one connected component of the form , G We are now in a position to prove Theorem 1 in the general case. For x ∈ X we proceed by considering collections of connected components {C i } i∈I of G x for some set I , and then finding an element y I ∈ Sym(∪ i∈I supp(C i )) that is conjugate to t I := i∈I t i such that the connected components of G t I y I and G y I x I satisfy the conditions of Corollary 1 (where x I := i∈I x i ). The product of all such y I will then be our desired element of X .
Proof of Theorem 1 Let x ∈ X .  (i) First assume that n = 2m + 1. We observe that the product of two elements of X that fix distinct elements of Ω cannot have order 4. Thus P {4} (G, X ) consists of n copies of the {4}-product involution graph P {4} (Sym(2m), Y ), where Y is the conjugacy class of Sym(2m) consisting of elements of cycle type 2 m .
By Corollary 2, as n = 2m +1, we may assume that | fix(t)| ≥ 2, and so G x contains at least 2 white vertices. Moreover, by Lemma 10 we only need to consider the case when fix(t) = fix(x). Let α, β, γ and δ denote the number of connected components (containing at least 1 black vertex and 1 edge) of G x of the form α: ; β: ; γ: ; and δ: , and let denote the number of connected components of the form . For ease of reading, we shall refer to components of type α instead of components of the form . Similarly for β, γ , δ and . Note that α ≤ β + , and as fix(t) = fix(x) it follows that β, γ and are not all zero.
If γ ≥ 2, then partitioning the components of type γ into pairs or triples we obtain a suitable y I from Lemmas 8(v) and 9(i). Indexing the remaining connected components by J , a suitable y J such that t J y J and x J y J have orders 1, 2 or 4 may be constructed using Lemmas 4, 5, and 8(i),(ii). In the forthcoming cases, when referring to the construction of y J , it will be implicit that t J y J and x J y J have orders 1, 2 or 4.
If γ = 1 and β = 0, then we pair the unique component of type γ with one of type β to obtain an element y I via Lemma 8(iv). An element y J for the remaining components follows from Lemmas 4, 5 and 8(i),(ii).
If γ = 1, β = 0 and α ≥ 1, then ≥ 1. Hence we may use Lemma 9(ii) to construct the element y I and Lemmas 4, 5 and 8(i) to obtain a suitable y J .
If γ = 1 and α = β = 0, then there must be a connected component of G x consisting of a single vertex. Assume first that the connected component of type γ contains at least two black vertices. If there is an isolated white vertex in G x , then the existence of y I follows from Lemma 8(iii). Conversely, if there is an isolated black vertex, then -as the number of black vertices equals the number of edges -there must be a connected component of type . Applying Lemma 9(ii) to this connected component, the connected component of type γ and an isolated black vertex results in our element y I . Applying Lemmas 4 and 5 to our remaining components as appropriate gives our desired element y J . Now assume that our connected component of type γ contains precisely one black vertex. If all other white vertices are isolated, then G x contains a connected component consisting of a cycle of u ≥ 1 black vertices. We may consider one such cycle, an isolated white vertex and the connected component of type γ to correspond to those components indexed by I . Thus without loss of generality 4); and unless u = 1 when we let t I = (1, 2)(3, 4)(5)(6) and x I = (1, 2)(3)(4, 5)(6). Taking y I = (1)(2u)(2, 2u − 1) · · · (u, u + 1)(2u + 1, 2u + 3)(2u + 2, 2u + 4) (or y I = (1)(2)(3, 5)(4, 6) if u = 1) it follows that G t I y I has one connected component of the form , G y I x I has one connected component of the form and the remaining components of these x-graphs are of the form , , , and , thus satisfying the conditions of Corollary 1. Conversely, if there exists a white vertex that is not isolated, then it will be in a component of type . Again, as the number of edges and black vertices must be equal, there exists an isolated black vertex. We take the connected component of type γ along with one of type and an isolated black vertex to be those indexed by I . The existence of y I then follows from Lemma 9(ii). Finally applying Lemmas 4 and 5 as appropriate to the remaining connected components, we obtain an element y J as required.
If γ = 0, but β = 0, then consider the connected components of type α. If there exist connected components of type α containing at least 3 black vertices, then we may pair these up with connected components of type β and and apply Lemma 8(i) to obtain our element y I . If all connected components of type α contain at most 2 black vertices, then we simply apply Lemma 8(ii) (if required) to the connected components of type β to obtain y I . Finally, applying Lemmas 4 and 5 to the remaining connected components ensures the existence of y J .
If β = γ = 0 and α = 0, then we apply Lemma 8(i) to the connected components of type α and (if required) to obtain y I and Lemmas 4 and 5 to the remaining connected components to find a suitable y J .
If α = β = γ = 0, then ≥ 1 as by assumption fix(t) = fix(x). As the number of edges of G x equals the number of black vertices, there exists an isolated black vertex. Moreover, as m ≥ 2, there are two possible cases. If every black vertex is isolated, then there exists m connected components of type . Take two such components and two isolated black vertices as the components corresponding to our indexing set I , and leave all other components of type alone. Without loss of generality, we may assume that the parts of t and x corresponding to I are Conversely, if there is only one isolated black vertex, then there exists a connected component which is a cycle of u ≥ 1 black vertices. Thus taking the components indexed by I to be an isolated black vertex, a cycle of u ≥ 1 black vertices and a component of type , and leaving all other components of type alone, we may take t I and x I to be 4); and or t I = (1, 2)(3, 4)(5)(6) and x I = (1, 2)(3)(4)(5, 6) if u = 1. Taking y I = (1)(2u)(2, 2u − 1) · · · (u, u + 1)(2u + 1, 2u + 3)(2u + 2, 2u + 4) (or if u = 1, taking y I = (1)(2)(3, 5)(4, 6)), we see that the connected components of G t I y I and G y I x I satisfy the conditions of Corollary 1. Finally, applying Lemmas 4 and 5 to the remaining components of type δ (that is cycles of black vertices) gives the desired y J .
Since all possible x-graphs have been analysed, this completes the proof of Theorem 1.

The Cases π = {4}
We illustrate the exceptional nature of P {4} (G, X ) with a brief exploration of other π -product involution graphs. We begin by considering the case that π = {2m} and 2m = 2 a for some a ≥ 3. The simplest such case arises when a = 3. Thus for G = Sym(n), we consider the G-conjugacy class of t = (1, 2)(3, 4)(5, 6)(7, 8), which we denote by X . As supp(t) has size 8, it suffices to consider 8 ≤ n ≤ 16. We calculate the sizes of the discs Δ i (t) of P {8} (G, X ) using the computer algebra package MAGMA (see [7,11]). Theorem 3 is an immediate consequence of our calculations, which are summarised in Table 2.
Suppose that for some 1 ≤ i < m an element y i of the form (1) exists with y i connected to t in P {2m} (G, X ). Note that y i fixes at least two elements of Ω as n ≥ 2m + 2. We denote these elements by f 1 , f 2 . Define x j,1 := min supp(x j ) and x j,2 := max supp(x j ).
(2) for 1 ≤ j ≤ i and w j,1 := min supp(w j ) and w j,2 := max supp(w j ). for We follow an analogous approach to that used to define y 1 . If | supp(x i+1 ) ∩ supp(w)| = 2, then without loss we have that w i+1,1 = α and w i+2,1 = β. First we construct an element z i+1 ∈ X given by for i > 1 and Consequently G y i z i+1 has the form given in (2). The element y i+1 of isomorphism type (1). We deduce that y i+1 is connected to y i and hence to t, and that d(y i , y i+1 ) ≤ 2.
Thus as x = y m , we conclude that Diam(P {2m} (G, X )) ≤ 2m − 1. For the lower bound, we note that x ∈ Δ 1 (t) precisely when G x is of type (1) or (2). In particular We now consider Theorem 4. A non-constructive proof of the connectivity of P {q} (G, X ) using Jordan's theorem is contained in the proof of [6, Theorem 4.1]. Here we give a constructive proof in a similar vein to the proof of Theorem 2 above.
Proof of Theorem 4 (i) We first note that the elements of the disc Δ 1 (t) are precisely those elements x ∈ X whose x-graph, G x , is of isomorphism type . Consequently, P {q} (G, X ) is totally disconnected if n = q −1. Thus assume that n ≥ q and hence that | fix(t)| ≥ 1.
We proceed as in the proof of Theorem 2 and set 2m = q − 1. Let x ∈ X be given and denote the transpositions of x as x = x 1 x 2 · · · x m . As in the proof of Theorem 2, we will construct elements y i ∈ X for i = 1, . . . m such that for some transpositions w j and such that y i is connected to t in P {q} (G, X ). Mirroring the situation of the proof of Theorem 2, we may assume that x i+1 is not a transposition of y i . We continue to use the notation x j,1 , x j,2 and w j,1 , w j,2 previously introduced in (2) and (3) respectively. For convenience we define y 0 := t and for each y i we consider the cases supp(y i ) = supp(x) and supp(y i ) = supp(x) separately.
The x-graphs G z 1 and G z 1 y 1 are both of isomorphism type and hence t and y 1 are connected in P {q} (G, X ) with d(t, y 1 ) ≤ 2.
We have that the x-graphs G y i z i+1 and G z i+1 y i+1 have the required form and hence d(y i , y i+1 ) ≤ 2.
For each pair (z i+1 , y i+1 ) the x-graphs G y i z i+1 and G z i+1 y i+1 have isomorphism type . Consequently d(y i , y i+1 ) ≤ 2 and the elements t and y i+1 are connected in P {q} (G, X ).
The proofs of Theorems 2 and 4 are utilised in the proof of Theorem 5.
Proof of Theorem 5 The x-graph G x of any x ∈ Δ 1 (t) must consist of a connected component of isomorphism type containing q i /2 black vertices for each i = 2, . . . , r . In addition, there will be connected components of types (1) or (2) from the proof of Theorem 2 if p 1 = 2, or a component of type containing q 1 /2 black vertices if p 1 = 2. It follows that | fix(t)| ≥ r + 1 if p 1 = 2; and r otherwise.
We conclude that if n ≥ q + 2 if p 1 = 2; and q otherwise (6) does not hold, then P {q} (G, X ) is totally disconnected. Conversely, assume that (6) holds, and denote the connected component of P {q} (G, X ) containing t by P t . By arranging the fixed points of t appropriately we may consider t as t = t 1 t 2 · · · t r ∈ Sym( p a 1 1 ) × Sym( p a 2 2 ) × · · · × Sym( p a r r ), where t i ∈ Sym( p a i i ). Applying Theorems 2 and 4, we see that Sym( p a 1 1 )×Sym( p a 2 2 )×· · ·× Sym( p a r r ) is a subgroup of Stab G (P t ). However, we may also interchange the fixed points of the t i to obtain different copies of Sym( p a 1 1 ) × Sym( p a 2 2 ) × · · · × Sym( p a r r ) contained in Stab G (P t ). Combining all such subgroups, it follows that Stab G (P t ) = G and hence P {q} (G, X ) is connected. Moreover, either one component is of isomorphism type (iv), or there exists at least one component of type (ii) and one component of type (iii). Finally, Table 3 gives the sizes of the discs Δ i (t) of P {6} (G, X ) for the symmetric groups G := Sym(n) (6 ≤ n ≤ 10), when X is the G-conjugacy class of an involution t ∈ G.