Home The commuting graph of a solvable 𝐴-group
Article Publicly Available

The commuting graph of a solvable 𝐴-group

  • Rachel Carleton ORCID logo EMAIL logo and Mark L. Lewis ORCID logo
Published/Copyright: February 2, 2024

Abstract

Let 𝐺 be a finite group. Recall that an 𝐴-group is a group whose Sylow subgroups are all abelian. In this paper, we investigate the upper bound on the diameter of the commuting graph of a solvable 𝐴-group. Assuming that the commuting graph is connected, we show when the derived length of 𝐺 is 2, the diameter of the commuting graph will be at most 4. In the general case, we show that the diameter of the commuting graph will be at most 6. In both cases, examples are provided to show that the upper bound of the commuting graph cannot be improved.

1 Introduction

In this paper, all groups are finite. Given a group 𝐺, we define the commuting graph of 𝐺, denoted Γ ( G ) , to be the graph whose vertices are the noncentral elements of 𝐺, and two distinct vertices are adjacent in Γ ( G ) if and only if they commute in 𝐺. A path in a graph is an ordered list of vertices x 1 , x 2 , , x n where there is an edge between x i and x i + 1 for all 𝑖. If any two vertices can be connected by a path, then the graph is said to be connected. The distance between two vertices is the length of the shortest path between two vertices if such a path exists. When the commuting graph is connected, we define the diameter of the graph to be the maximum value of the set of distances between the vertices.

The commuting graphs of various families of groups have been studied by several authors in the past. A common question that arises is when will the commuting graph of a group be connected, and if connected, what is the upper bound on the diameter. In 2002, Segev and Seitz showed that the commuting graph of a classical simple group defined over a field of order greater than 5 is either disconnected or has diameter between 4 and 10 (see [12]). In [8], Iranmanesh and Jafarzedah investigated the commuting graph of the symmetric and alternating groups, and determined that the commuting graph of such groups is either disconnected or has diameter at most 5. In that same paper, Iranmanesh and Jafarzedah conjectured that the diameter of the commuting graph of any finite, non-abelian group could be bounded by a universal constant. However, work by Giudici and Parker in [3] provided a family of 2-groups that serve as a counterexample to that conjecture. While the conjecture that there is a universal bound on the diameter of the commuting graph of any finite, non-abelian group turned out to be false, the conjecture does hold for groups with trivial center. In [11], Parker proved that a solvable group with trivial center will be either disconnected or have diameter at most 8. In that paper, he also provided an example of a family of groups that have connected commuting graphs with diameter exactly 8, showing that this bound is sharp. Expanding on this work in [10], Parker and Morgan dropped the solvability hypothesis to show that, for any group with trivial center, the commuting graph will either be disconnected or have diameter at most 10.

In [2], the authors looked to expand the results on the commuting graph of a group with trivial center to groups where G Z ( G ) = 1 . They show that, in this case, Γ ( G ) will be connected if and only if Γ ( G / Z ( G ) ) is connected. Furthermore, the authors prove that, when connected, the two commuting graphs will have the same diameter. Note that if G Z ( G ) = 1 , then Z ( G / Z ( G ) ) is trivial. Thus, the results of [10] apply to G / Z ( G ) , and the authors of [2] conclude that Γ ( G / Z ( G ) ) will either be disconnected or have diameter at most 10. If 𝐺 is solvable, the authors conclude that Γ ( G ) will be disconnected or have diameter at most 8.

One class of groups that satisfies the condition G Z ( G ) = 1 is the class of A-groups, groups whose Sylow subgroups are all abelian. Solvable 𝐴-groups were first discussed by Hall in some remarks at the end of [7] and written up formally by Taunt in [13]. Since 𝐴-groups satisfy the property that G Z ( G ) = 1 , the results of [2] apply to 𝐴-groups. In particular, the commuting graph of a solvable 𝐴-group will be disconnected or have diameter at most 8; however, the authors conjectured that the actual bound on the diameter of the commuting graph of a solvable 𝐴-group would be lower than 8. In this paper, we will prove that the upper bound on the diameter of the commuting graph of an 𝐴-group is at most 6. Since [2] establishes when the commuting graph of a solvable 𝐴-group will be disconnected, we will focus on the case when 𝐺 is a solvable 𝐴-group with connected commuting graph.

Theorem 1.1

Let 𝐺 be a solvable 𝐴-group such that G / Z ( G ) is neither a Frobenius nor 2-Frobenius group. Then the diameter of the commuting graph of 𝐺 is at most 6.

In Section 2, we provide some preliminary results, particularly on various properties of solvable 𝐴-groups, that will be needed to prove the bound on the diameter of the commuting graph. In Section 3, we focus on the case where the derived length of 𝐺 is 2. We prove that, in this case, the diameter of the commuting graph will be at most 4. In Section 4, we prove that the commuting graph of any solvable 𝐴-group has diameter at most 6. Lastly, we provide an example of a solvable 𝐴-group with connected commuting graph with diameter 6, showing that the bound of 6 cannot be further improved.

The work in this paper was completed while the first author was a Ph.D. student at Kent State University under the direction of the second author. This work will appear as a portion of the first author’s Ph.D. dissertation at Kent State University.

2 Preliminaries

Before we can prove Theorem 1.1, we first provide results about 𝐴-groups, given by Taunt in [13]. The first result regards the intersection of the center and derived subgroup of 𝐴-groups, and applies to all 𝐴-groups, not just solvable ones.

Lemma 2.1

Lemma 2.1 ([13, Theorem 4.1])

Let 𝐺 be an 𝐴-group. Then G Z ( G ) = 1 .

With solvable 𝐴-groups, it can be useful to look at the terms of the derived series and the relative system normalizers of those terms. A Sylow system of a group 𝐺 is a set of Sylow subgroups, one for each prime dividing the order of 𝐺, such that each pair of Sylow subgroups permute. Sylow systems were studied by Hall in [5]. Given a Sylow system 𝒮 of 𝐺, we can define its system normalizer M ( G ) = { g G g P g 1 = P , P S } to be the set of all elements in 𝐺 that normalize every Sylow subgroup in 𝒮. System normalizers were studied by Hall in [6]. If 𝐺 is part of a larger group 𝐿, then, given a Sylow system 𝒮, of 𝐺, we can define the following group:

M L ( G ) = { L P 1 = P , P S } .

We call M L ( G ) a system normalizer of 𝐺 relative to 𝐿 or a relative system normalizer of 𝐺. When L = G , we will call M L ( G ) an absolute system normalizer.

In his paper on the construction of solvable groups [7], Hall looked at constructing partially complemented extensions of a characteristic subgroup by a partial complement belonging to a characteristic class of conjugate subgroups. In solvable subgroups, the relative system normalizers form such a characteristic class. More specifically, Hall showed that if H / N is any nilpotent factor of the (not necessarily solvable) group 𝐺, then G = M G ( H ) N , where M G ( H ) is a system normalizer of 𝐻 relative to 𝐺. Furthermore, when 𝐺 is solvable, Hall showed that one could choose 𝐻 and 𝑁 from adjacent terms in the lower nilpotent series. The lower nilpotent series is the series G = L 0 L 1 L n , where L i is the smallest normal subgroup of L i 1 such that L i 1 / L i is nilpotent. This series is also known as the lower Fitting chain or lower Fitting series. Note that, in 𝐴-groups, nilpotent subgroups are necessarily abelian, and so the lower nilpotent series coincides with the derived series, so we can take H = G ( i 1 ) and N = G ( i ) . What makes Hall’s construction theory especially useful for 𝐴-groups is that the relative system normalizers of the terms of the derived series are complements of the subsequent term in the derived series.

Lemma 2.2

Lemma 2.2 ([13, Corollary 4.5])

Let G = G ( 0 ) G = G ( 1 ) G ( n ) = 1 be the derived series of 𝐺. Let M G ( G ( i ) ) be a relative system normalizer for G ( i ) in 𝐺. Then G = M G ( G ( i 1 ) ) G ( i ) , and M G ( G ( i 1 ) ) is a complement for G ( i ) in 𝐺. In particular, if 𝑀 is any absolute system normalizer of 𝐺, then 𝑀 is a complement of G in 𝐺.

When bounding the diameter of the commuting graph of a solvable 𝐴-group, we will search for paths through the Fitting subgroup. In 𝐴-groups, we have that the Fitting subgroup is the direct product of the centers of the terms of the derived series.

Lemma 2.3

Lemma 2.3 ([13, Theorem 5.4])

If 𝐺 is a solvable 𝐴-group with derived length 𝑛, then F ( G ) = Z ( G ) × Z ( G ) × × Z ( G ( n 1 ) ) .

To prove the bound of 6 on the diameter of the commuting graph of an 𝐴-group, we will also need the following result on Frobenius groups. Note that the next lemma applies to more than just 𝐴-groups.

Lemma 2.4

Lemma 2.4 ([9, Theorem 6.4])

Let 𝑁 be a normal subgroup of a finite group 𝐺, and suppose that 𝐴 is a complement for 𝑁 in 𝐺. The following are equivalent.

  1. 𝐺 is a Frobenius group with kernel 𝑁.

  2. C G ( a ) A for all nontrivial a A .

  3. C G ( n ) N for all nontrivial n N .

Lastly, we will need the following result, which delivers elements with nontrivial centralizers. Again, note this result applies to more than just 𝐴-groups.

Lemma 2.5

Lemma 2.5 ([1, Theorem 36.2])

Let 𝑝, 𝑞, and 𝑟 be distinct primes, 𝑋 a group of order 𝑟 that acts faithfully on a 𝑞-group 𝑄 and let 𝑉 be a faithful GF ( p ) X Q -module. Additionally if q = 2 and 𝑟 is a Fermat prime, assume 𝑄 is abelian. Then C V ( X ) 0 .

The paper [2] establishes for 𝐴-groups that Γ ( G ) will be connected if and only if Γ ( G / Z ( G ) ) is connected. When G / Z ( G ) is solvable, Γ ( G / Z ( G ) ) is disconnected if and only if G / Z ( G ) is a Frobenius or 2-Frobenius group. A 2-Frobenius group is a group 𝑋 with normal subgroups 𝐻 and 𝐾 such that 𝐻 is a Frobenius group with kernel 𝐾 and X / K is a Frobenius group with kernel H / K . Since we are interested in finding the upper bound of the diameter of a connected commuting graph, we will focus our attention on the case when 𝐺 is a solvable 𝐴-group with connected commuting graph, that is, when G / Z ( G ) is neither a Frobenius nor 2-Frobenius group. We will thus use the following hypothesis in many of the proofs in Sections 3 and 4.

Hypothesis 2.6

Let 𝐺 be a solvable, non-abelian 𝐴-group such that G / Z ( G ) is neither a Frobenius nor 2-Frobenius group.

From [2], we also have for 𝐴-groups that, when connected, the diameter of Γ ( G ) and Γ ( G / Z ( G ) ) will be the same. Using this result, we may additionally narrow our focus down to solvable 𝐴-groups with trivial center. For if Z ( G ) 1 , then we can look instead at the commuting graph of G / Z ( G ) , which is a group with trivial center. Note that, when Z ( G ) is trivial and 𝐺 has connected commuting graph, we then get that 𝐺 is neither a Frobenius nor 2-Frobenius group.

Lastly, we will establish some notation that will be used throughout the rest of the paper. For any group 𝐺, let G # represent the set of nontrivial elements in 𝐺. Let π ( G ) represent the set of prime divisors of the order of 𝐺. If two noncentral elements commute, we will write x y as such notation helps us to count the length of a path between 𝑥 and 𝑦 in Γ ( G ) . If 𝑥 and 𝑦 are noncentral elements, then d ( x , y ) denotes the distance between 𝑥 and 𝑦 in the commuting graph.

3 Case when G is abelian

Before investigating 𝐴-groups in general, we will first investigate the case where 𝐺 has derived length 2 and is thus metabelian. In these groups, we get an even lower bound on the diameter of the commuting graph.

Lemma 3.1

Let 𝐺 be a solvable 𝐴-group of derived length 2 with trivial center such that G is not a Hall subgroup. Let 𝑔 be an element of 𝐺 and 𝑝 a prime dividing the order of 𝑔. If the 𝑝-part of 𝑔 does not lie in G and does not lie in any absolute system normalizer of 𝐺, then C G ( g ) 1 and there exists an absolute system normalizer 𝑀 of 𝐺 such that C M ( g ) 1 .

Proof

Let 𝐺 be a solvable 𝐴-group of derived length 2 with trivial center such that G is not a Hall subgroup. From Lemma 2.2, we have that G = M G , where 𝑀 is an absolute system normalizer of 𝐺 and M G = 1 . Since Z ( G ) = 1 , note that F ( G ) = G by Lemma 2.3. Let 𝑔 be an element of 𝐺 such that the 𝑝-part of 𝑔 does not lie in G for some prime 𝑝. Denote the 𝑝-part of 𝑔 by g p . If g p does not lie in any absolute system normalizer of 𝑀, then we have that 𝑝 divides both | G | and | M | . Let 𝑃 be a Sylow 𝑝-subgroup of 𝐺 containing g p . We have that P = M p × O p ( G ) , where M p is the Sylow 𝑝-subgroup of an appropriately chosen conjugate of 𝑀. Since g p M p , we have that g p = m p f p , with m p M p and f p O p ( G ) . Note that, because m p and f p lie in the same Sylow 𝑝-subgroup of 𝐺, they will commute. We will show that g m p and g f p .

If g = g p , then 𝑔 is a 𝑝-element. Furthermore, 𝑔 lies in the same Sylow subgroup as m p and f p , so we have g m p and g f p . So suppose that the order of 𝑔 is divisible by at least 2 distinct primes. We can write g = g p g q 1 g q 2 g q r , where g q i represents the q i -part of 𝑔 for distinct primes q 1 , q 2 , , q r . To show that g m p and g f p , we will show that g q i m p and g q i f p for each 𝑖.

We can write g q i = m q i f q i , where m q i lies in a conjugate of 𝑀 and f q i G . If m q i = 1 , then g q i = f q i G . As G is abelian, we have f p f q i . Therefore, since g p g q i = f q i , we get that f q i m p f p = m p f p f q i = m p f q i f p . Hence, we have f q i m p , and we are done. Therefore, suppose that m q i 1 . We then get the following:

g p g q i = g q i g p , m p f p m q i f q i = m q i f q i m p f p , m p f p f q i m q i = m q i f q i f p m p , m p f q i f p m q i = m q i f q i f p m p , m q i 1 m p ( f q i f p ) = ( f q i f p ) m p m q i 1 .

Note that we have not assumed that m p and m q i lie in the same conjugate of 𝑀, so we must show that these elements commute. To do so, let 𝐾 be a Hall { p , q i } -subgroup of 𝐺 containing g p g q i . Let K 0 be the intersection of 𝐾 with an appropriately chosen conjugate of 𝑀 and let K 1 = K G . Let M p and M q i be the Sylow 𝑝- and q i -subgroups of K 0 respectively, and let F p and F q i be the Sylow 𝑝- and q i -subgroups of 𝐾 respectively. Note that F p = O p ( G ) and F q i = O q i ( G ) . We will show that the number of conjugates of K 0 in 𝐾 is the number of conjugates of M p times the number of conjugates of M q i .

First, we will show that N K ( M p ) = N F q i ( M p ) F p K 0 . Note that, as K 0 is abelian, it will centralize M p . Similarly, as the elements of F p centralize every 𝑝-element in 𝐺, we have that F p centralizes M p . Thus, N F q i ( M p ) F p K 0 N K ( M p ) . Thus, we need to show the reverse containment. Let x N K ( M p ) . We can write x = x 1 x 0 for some x 1 K 1 , x 0 K 0 . Furthermore, note that x 1 = k q i k p , where k q i F q i , k p F p . Then we have that

M p = x M p x 1 = ( k q i k p x 0 ) M p ( k q i k p x 0 ) 1 = k q i k p x 0 M p x 0 1 k p 1 k q i 1 = k q i k p M p k p 1 k q i 1 = k q i M p k q i 1 .

Hence, k q i N F q i ( M p ) . Therefore, x = k q i k p x 0 N F q i ( M p ) F p K 0 . Through a similar argument, we can show that

N K ( M q i ) = N F p ( M q i ) F q i K 0 and N K ( K 0 ) = N K 1 ( K 0 ) K 0 .

Next, we want to show that N K 1 ( K 0 ) = N K 1 ( M p ) N K 1 ( M q i ) . To do this, first suppose x N K 1 ( K 0 ) . Then we have that x M p x 1 K 0 , so 𝑥 will send M p to one of its conjugates in K 0 . However, as K 0 is abelian (as it is a subgroup of a conjugate of 𝑀, which is abelian), we have that M p is the only Sylow 𝑝-subgroup of K 0 . Hence, x M p x 1 = M p . Similarly, we have that x M q i x 1 = M q i . Therefore,

x N K 1 ( M p ) N K 1 ( M q i ) .

Now, suppose x N K 1 ( M p ) N K 1 ( M q i ) . Then we have that x M p x 1 = M p and x M q i x 1 = M q i . Thus, we have that

x K 0 x 1 = x ( M p M q i ) x 1 = x M p x 1 x M q i x 1 = M p M q i = K 0 .

Hence, x N K 1 ( K 0 ) . Thus, we have that

N K 1 ( K 0 ) = N K 1 ( M p ) N K 1 ( M q i ) = F p N F q i ( M p ) N F p ( M q i ) F q i = N F p ( M q i ) N F q i ( M p ) .

Using this, we see that

| K : N K ( M p ) | = | K | | K 0 | | F p | | N F q i ( M p ) | = | F q i | | N F q i ( M p ) | , | K : N K ( F q i ) | = | K | | K 0 | | F q i | | N F p ( M q i ) | = | F p | | N F p ( M q i ) | , | K : N K ( K 0 ) | = | K | | K 0 | | N K 1 ( K 0 ) | = | K 1 | | N K 1 ( K 0 ) | = | F p | | F q i | | N F p ( M q i ) | | N F q i ( M p ) | .

Thus, the number of conjugates of K 0 in 𝐾 is exactly the number of conjugates of M p times the number of conjugates of M q i . This means that each conjugate of M p commutes with each conjugate of M q i to form all the distinct conjugates of K 0 , meaning that each conjugate of M p centralizes each conjugate of M q i . Thus, we have that m p m q i .

This gives us that m q i 1 m p f q i f p . Therefore, ( m q i 1 m p ) n 1 ( f q i f p ) n 2 for any n 1 , n 2 Z . Therefore, we have m q i f p and f q i m p . Therefore, g q i m p and g q i f p . Since this holds for all 𝑖, we therefore have that g m p and g f p . Hence, C M ( g ) 1 and C G ( g ) 1 . ∎

Lemma 3.2

Assume Hypothesis 2.6 and suppose that Z ( G ) = 1 . Furthermore, suppose that the derived length of 𝐺 is 2. Then Γ ( G ) is connected of diameter at most 4.

Proof

Let the derived length of 𝐺 be 2. Thus, 𝐺 is metabelian and G is abelian. From Lemma 2.2, we have that G = M G , where 𝑀 is an absolute system normalizer of 𝐺, and M G = 1 . As M G / G , we have that 𝑀 is abelian. Additionally, since Z ( G ) = 1 , we have that F ( G ) = G by Lemma 2.3.

Since 𝐺 is not a Frobenius group, there exists x * M # such that C G ( x * ) 1 . Consider x * G . Let g G # , and note that we can write g = m g , where m M and g G . We have that g x * G g 1 = ( m g ) x * G ( m g ) 1 = m x * G m 1 as g G x * G . Furthermore, as m M and G G , we have that

m x * G m 1 = x * G .

Therefore, x * G G . Hence, as 𝑀 intersects x * G nontrivially, we have that every conjugate of 𝑀 intersects x * G nontrivially. Since C G ( x * ) 1 , we have that Z ( x * G ) 1 . So fix c * Z ( x * G ) # . We will show that d ( g , c * ) 2 for all g G # .

Let g G # . If there exists a positive integer n < o ( g ) such that g n G , we have that g g n c * . Hence, d ( g , c * ) 2 . Suppose that there does not exist such an integer 𝑛. In particular, this gives us that g G . If 𝑔 lies in some conjugate of 𝑀, we have that g x c * , where 𝑥 lies in the intersection of x * G with an appropriately chosen conjugate of 𝑀. Hence, d ( g , c * ) 2 . That leaves the case where 𝑔 is neither an element of G nor of a conjugate of 𝑀. Hence, there exists a prime 𝑝 such that the 𝑝-part of 𝑔 is neither an element of G nor of a conjugate of 𝑀. Note that, in this case, G is not a Hall subgroup of 𝐺. Therefore, 𝑔 satisfies the hypothesis of Lemma 3.1, and so C G ( g ) 1 . Hence, we have that g f c * , where f C G ( g ) # . Therefore, d ( g , c * ) 2 . Thus, we have that, for any g G , d ( g , c * ) 2 . This means that the diameter of the commuting graph of 𝐺 will be at most 4. ∎

Since we have proven that the diameter of the commuting graph of an 𝐴-group with trivial center will be at most 4, we will now prove that any 𝐴-group that has a connected commuting graph will have diameter at most 4.

Lemma 3.3

Let 𝐺 satisfy Hypothesis 2.6, and assume that 𝐺 has derived length 2. Then Γ ( G ) is connected with diameter at most 4.

Proof

Let 𝐺 be a solvable 𝐴-group satisfying Hypothesis 2.6 and let Z = Z ( G ) . We then have that G / Z is neither a Frobenius nor a 2-Frobenius group. Furthermore, the commuting graphs of 𝐺 and G / Z have the same diameter. Recall that Lemma 2.1 gives us that G Z = 1 . Thus, we have that ( G / Z ) = G Z / Z G . Therefore, as 𝐺 is metabelian and thus G abelian, we get that ( G / Z ) is abelian. Therefore, the derived length of G / Z is 2. From the previous lemma, we get that the diameter of Γ ( G / Z ) is at most 4. Hence, the diameter of Γ ( G ) is at most 4. ∎

Note that SmallGroup ( 60 , 7 ) from the GAP Small Groups Library is an example of an 𝐴-group of derived length 2 with connected commuting graph of diameter 4, so the bound in Lemma 3.2 cannot be improved. The following two corollaries apply the results of Lemma 3.3 to particular classes of 𝐴-groups that have derived length 2.

Corollary 3.4

Suppose that 𝐺 satisfies Hypothesis 2.6 and that the order of 𝐺 is p a q b for distinct primes 𝑝 and 𝑞. Then Γ ( G ) is connected of diameter at most 4.

Proof

By [13, Theorem 8.3], we have that the derived length is at most 2. As 𝐺 is non-abelian, we have that the derived length is exactly 2. Thus, by Lemma 3.3, we have that Γ ( G ) is connected of diameter at most 4. ∎

Corollary 3.5

Suppose that 𝐺 is a group of cube-free odd order such that G / Z ( G ) is neither a Frobenius nor 2-Frobenius group. Then Γ ( G ) is connected of diameter at most 4.

Proof

Suppose that 𝐺 is a group of cube-free order and that the order of 𝐺 is odd. Note that as 𝐺 has cube-free order, 𝐺 is an 𝐴-group. By [13, Theorem 8.4], the derived length of 𝐺 is 2. Hence, by Lemma 3.3, we have that Γ ( G ) is connected of diameter at most 4. ∎

4 Main result

We will now turn our attention to proving the bound on the diameter of the commuting graph of any solvable 𝐴-group. To do so, we will assume that the diameter of the commuting graph is at least 7 and proceed by contradiction. Let F = F ( G ) , Z = Z ( G ) , and let 𝐽 be the preimage of F ( G / F ) . From [11], we have that a solvable group with trivial center that has a commuting graph of diameter 7 or higher has a fairly restricted structure. The first thing we can say about such a group is that the Fitting subgroup is the centralizer of a minimal normal subgroup.

Lemma 4.1

Lemma 4.1 ([11, Lemma 3.4])

Let 𝐺 be a solvable group with trivial center and let 𝑉 be a minimal normal subgroup of 𝐺. If the diameter of Γ ( G ) is at least 7, then F = C G ( V ) .

Furthermore, we get that the Fitting subgroup is a Hall subgroup of 𝐽.

Lemma 4.2

Lemma 4.2 ([11, Lemma 3.5])

Let 𝐺 be any solvable group with trivial center. If the diameter of Γ ( G ) is at least 7, then | J / F | is coprime to | F | .

The following lemma is adapted from [11, Lemma 3.9], with the statement and proof modified to better work with 𝐴-groups.

Lemma 4.3

Suppose 𝐺 satisfies Hypotheses 2.6 and that Z ( G ) = 1 . Assume that the diameter of Γ ( G ) 7 and that 𝑉 is a minimal normal subgroup of 𝐺. Let g G and n Z such that o ( g n ) = p for some prime 𝑝. If C V ( g n ) = 1 , then g n J .

Proof

Let g G such that o ( g n ) = p for some prime 𝑝 and that C V ( g n ) = 1 . Suppose g n J . As G / F is solvable and J / F = F ( G / F ) , we have that there exists a prime 𝑡 such that the Sylow 𝑡-subgroup of J / F is not centralized by g n . Since 𝐺 is an 𝐴-group (and therefore G / F is also an 𝐴-group), we have that p t . Choose T Syl t ( J ) to be g n invariant. Note that T g n acts faithfully on 𝑉 by Lemma 4.1. However, as C V ( g n ) = 1 , Lemma 2.5 gives us a contradiction. Therefore, g n J . ∎

We are now ready to prove that an 𝐴-group with trivial center that is neither Frobenius nor 2-Frobenius will have a commuting graph with diameter at most 7.

Theorem 4.4

Let 𝐺 satisfy Hypotheses 2.6 and suppose that Z ( G ) = 1 . Then Γ ( G ) is connected of diameter at most 6.

Proof

Suppose that 𝐺 satisfies Hypotheses 2.6 and that Z ( G ) = 1 . Since 𝐺 is neither Frobenius nor 2-Frobenius, we know that Γ ( G ) is connected by the main result of [11]. Therefore, we need only prove that the upper bound of the diameter of the commuting graph is 6. We proceed by contradiction and assume that Γ ( G ) has diameter at least 7. If we can show that every element in 𝐺 has a distance of at most 3 from some specific element c * F # , then we will get that the diameter of Γ ( G ) is at most 6, giving us our desired contradiction.

First, assume that 𝐽 is not a Frobenius group. From Lemma 4.2, we have that | J / F | and | F | are coprime. Thus, 𝐹 is a normal Hall subgroup of 𝐽 and so has a complement in 𝐽. Let 𝐾 be a complement to 𝐹 in 𝐽. Note that, as K J / F , we have that 𝐾 is abelian. Since 𝐽 is not Frobenius, we have that there exists k * K # such that C * = C F ( k * ) 1 . Consider N G ( C * ) . As 𝐹 is abelian and C * F we have that 𝐹 normalizes C * . Since F G , we have that x c x 1 F for all c F , x K . Therefore, since ( x c x 1 ) k * = x c k * x 1 = x k * c x 1 = k * ( x c x 1 ) for all x K , c C * , we have that x c x 1 C * , and so 𝐾 normalizes C * . Thus, N G ( C * ) K F = J , and so 𝐽 normalizes C * . Hence, every conjugate of 𝐾 lies in N G ( C * ) . In particular, as 𝐾 intersects C G ( C * ) nontrivially, every conjugate of 𝐾 intersects C G ( C * ) nontrivially.

Fix c * ( C * ) # . Let g G . If we can find a positive integer n < o ( g ) for which C F ( g n ) 1 , then we have that

g g n f c *

for some f C F ( g n ) # . Thus, we must assume that C F ( g n ) = 1 for every positive integer n < o ( g ) . In particular, when g n has prime order, we have that g n J by Lemma 4.3. As C F ( g n ) = 1 , we have that g n has order coprime to the order of 𝐹. Therefore, g n lies is some Hall π ( J / F ) -subgroup of 𝐽, which is contained in some conjugate of 𝐾. Without loss of generality, we may assume g n lies in 𝐾. Therefore, g n k * and we have that

g g n k * c * .

Hence, in either case, we get that d ( g , c * ) 3 . Therefore, if 𝐽 is not a Frobenius group, we get that the diameter of the commuting graph is at most 6, which contradicts our initial assumption that the diameter is at least 7.

Therefore, we must have that 𝐽 is a Frobenius group with complement 𝐾. Since J / F K , we get that J / F is cyclic. Thus, Aut ( J / F ) is abelian, and we have that

N G / F ( J / F ) / C G / F ( J / F ) = ( G / F ) / ( J / F ) G / J

is abelian. Since G / J is abelian, we have that the derived length of 𝐺 is at most 3. Since 𝐺 is not abelian, the derived length is at least 2. However, if the derived length is 2, then we have already shown in Lemma 3.2 that the diameter of Γ ( G ) will be at most 4, which is a contradiction. So that gives us that the derived length of 𝐺 is 3, and we can write 𝐺 as G = H G ′′ , where H = M G ( G ) is a relative system normalizer for G in 𝐺. Note that H G = M 1 is an absolute system normalizer of G . Furthermore, for the appropriate choice of Sylow system of G , we have that an absolute system normalizer M 0 of 𝐺 will be contained in 𝐻. As | H | = | M 0 | | M 1 | , we can write 𝐻 as H = M 0 M 1 . Therefore, we get G = M 0 M 1 G ′′ . Note that F = Z ( G ) × G ′′ by Lemma 2.3. As 𝐽 is a Frobenius group and G J , we have that G is Frobenius and therefore Z ( G ) = 1 . Hence, F = G ′′ .

Note that, as 𝐺 is not a Frobenius group and every element of M 1 # acts fixed-point freely on 𝐹, we have that there exists x * M 0 # such that C F ( x * ) 1 . Consider x * F . Note that there are

| G : N G ( x * F ) | = | M 1 : N M 1 ( x * F ) | = | M 1 : N M 1 ( x * ) |

conjugates of x * F in 𝐺 and that there are | H : N H ( x * ) | = | M 1 : N M 1 ( x * ) | conjugates of x * in 𝐻. Therefore, each conjugate of x * in 𝐻 intersects a distinct conjugate of x * F in 𝐺. Furthermore, every conjugate of 𝐻 will intersect each conjugate of x * F nontrivially. We have that Z ( x * F ) 1 . So choose x * M 0 # to be as above and fix c * Z ( x * F ) # .

Let g G . As in the previous case, if we can find an integer n < o ( g ) for which C F ( g n ) 1 , then g g n f c * , where f C F ( g n ) # , and d ( g , c * ) 3 . Hence, we must have that C F ( g n ) = 1 for all n < o ( g ) . In this case, the order of 𝑔 must be coprime to the order of the Fitting subgroup. Hence, 𝑔 lies in some conjugate of H; without loss of generality, we can say that g H .

First, suppose that J 0 = J M 0 1 . Therefore, we have G J . Note that, as J / F = F ( G / F ) , we have from Lemma 2.3 that

J / F = Z ( G / F ) × Z ( ( G / F ) ) = Z ( G / F ) × G / F G / F .

Therefore, Z ( G / F ) 1 . Note that as H G / F , we therefore have Z ( H ) 1 . Let z Z ( H ) # . Therefore, we have that

g z x * c * .

Hence, d ( g , c * ) 3 . In both cases, we get that d ( g , c * ) 3 , and so the diameter of Γ ( G ) is at most 6, a contradiction.

That leaves the case when J 0 = 1 and so J = G . However, from Lemma 2.3, we have that

J / F = Z ( G / F ) × G / F = G / F ,

which means that Z ( G / F ) = 1 . Hence, we have that Z ( H ) = 1 . Suppose that x M 0 has prime order. By Lemma 4.3, we have that if C F ( x ) = 1 , then x J . However, M 0 J = 1 , which gives us a contradiction. Thus, every element of prime order in M 0 centralizes some element in F # .

Therefore, we can choose any such element to act as x * as in the previous case. To ensure shortest path between M 0 and M 1 , we will therefore choose x * M 0 so that C M 1 ( x * ) 1 . As before, note that each conjugate of x * in 𝐻 corresponds to a unique conjugate of x * F in 𝐺. Fix c * Z ( x * F ) # .

By Lemma 4.3, as C F ( g n ) = 1 for all n < o ( g ) , we have that g n J = G whenever g n has prime order. More specifically, we get that g n lies in some conjugate of M 1 . Without loss of generality, g n M 1 . Since this holds for all integers 𝑛 for which o ( g n ) is prime, we get that every prime dividing o ( g n ) also divides | M 1 | . Hence, 𝑔 is a π ( M 1 ) -element, and so g H . If g M 1 , we have that

g y x * c * ,

where y C M 1 ( x * ) # . Thus, d ( g , c * ) 3 . Thus, we must have that 𝑔 is a π ( M 1 ) -element that does not lie in M 1 . Thus, there exists a prime 𝑝 dividing the order of 𝑔 such that the 𝑝-part of 𝑔 does not lie in M 1 . In particular, this gives us that M 1 is not a Hall subgroup of 𝐻. Note that the absolute system normalizers of 𝐻 are the conjugates of M 0 contained in 𝐻. Thus, we have that 𝐻 is a solvable 𝐴-group of derived length 2 and that M 1 = H is not a Hall subgroup of 𝐻; furthermore, we have that 𝑔 is an element of 𝐻 such that the 𝑝-part of 𝑔 does not lie in M 1 = H or any absolute system normalizer of 𝐻. Hence, by Lemma 3.1, we have that C M 0 ( g ) 1 . Thus, we can find an element 𝑥 of prime order in C M 0 ( g ) # so that

g x f c * ,

where f C F ( x ) # . Therefore, we have d ( g , c * ) 3 . This means that, in all cases, d ( g , c * ) 3 . Hence, we have that the diameter of the commuting graph is at most 6, contradicting our original hypothesis that the diameter was at least 7. Therefore, we have that the diameter of the commuting graph will be at most 6. ∎

Having proven that the diameter of the commuting graph of a solvable group with trivial center is at most 6, we are now ready to prove Theorem 1.1.

Proof of Theorem 1.1

Let 𝐺 be a solvable 𝐴-group such that G / Z is neither a Frobenius nor 2-Frobenius group. Since G / Z is neither a Frobenius nor 2-Frobenius group, we have that Γ ( G / Z ) is connected. Theorem 4.4 gives us that the diameter of Γ ( G / Z ) is at most 6. From [2], we have that the diameter of Γ ( G ) is the same as the diameter of Γ ( G / Z ) . Thus, Γ ( G ) is connected with diameter at most 6. ∎

Lastly, we provide an example of a solvable 𝐴-group with a connected commuting graph that has a diameter of 6, showing that the bound in Theorem 1.1 cannot be improved. The example comes from the Small Groups Library. The group SmallGroup ( 1500 , 115 ) was investigated by Giudici and Pope in [4] as part of their investigation of the commuting graph of solvable groups in the Small Groups Library. Let G = SmallGroup ( 1500 , 115 ) . Note that the center of this group is trivial, while the derived subgroup, which has order 375, has nontrivial center. The 2-elements in this group do not commute with any of the elements in the Fitting subgroup, which is the Sylow 5-subgroup of 𝐺. Furthermore, the generators of order 4 do not commute with any 3-elements. Hence, the distance between any element of order 4 and any nontrivial element in the center of the derived subgroup will be at most 3. Thus, the maximum distance between any two elements of 𝐺 will be exactly 6.

  1. Communicated by: Michael Giudici

References

[1] M. Aschbacher, Finite Group Theory, 2nd ed., Cambridge Stud. Adv. Math. 10, Cambridge University, Cambridge, 2000. 10.1017/CBO9781139175319Search in Google Scholar

[2] N. F. Beike, R. Carleton, D. G. Costanzo, C. Heath, M. L. Lewis, K. Lu and J. D. Pearce, Extending results of Morgan and Parker about commuting graphs, Bull. Aust. Math. Soc. 105 (2022), no. 1, 92–100. 10.1017/S0004972721000332Search in Google Scholar

[3] M. Giudici and C. Parker, There is no upper bound for the diameter of the commuting graph of a finite group, J. Combin. Theory Ser. A 120 (2013), no. 7, 1600–1603. 10.1016/j.jcta.2013.05.008Search in Google Scholar

[4] M. Giudici and A. Pope, On bounding the diameter of the commuting graph of a group, J. Group Theory 17 (2014), no. 1, 131–149. 10.1515/jgt-2013-0023Search in Google Scholar

[5] P. Hall, On the Sylow systems of a soluble group, Proc. Lond. Math. Soc. (2) 43 (1937), no. 4, 316–323. 10.1112/plms/s2-43.4.316Search in Google Scholar

[6] P. Hall, On the system normalizers of a soluble group, Proc. Lond. Math. Soc. (2) 43 (1937), no. 7, 507–528. 10.1112/plms/s2-43.6.507Search in Google Scholar

[7] P. Hall, The construction of soluble groups, J. Reine Angew. Math. 182 (1940), 206–214. 10.1515/crll.1940.182.206Search in Google Scholar

[8] A. Iranmanesh and A. Jafarzadeh, On the commuting graph associated with the symmetric and alternating groups, J. Algebra Appl. 7 (2008), no. 1, 129–146. 10.1142/S0219498808002710Search in Google Scholar

[9] I. M. Isaacs, Finite Group Theory, Grad. Stud. Math. 92, American Mathematical Society, Providence, 2008. Search in Google Scholar

[10] G. L. Morgan and C. W. Parker, The diameter of the commuting graph of a finite group with trivial centre, J. Algebra 393 (2013), 41–59. 10.1016/j.jalgebra.2013.06.031Search in Google Scholar

[11] C. Parker, The commuting graph of a soluble group, Bull. Lond. Math. Soc. 45 (2013), no. 4, 839–848. 10.1112/blms/bdt005Search in Google Scholar

[12] Y. Segev and G. M. Seitz, Anisotropic groups of type A n and the commuting graph of finite simple groups, Pacific J. Math. 202 (2002), no. 1, 125–225. 10.2140/pjm.2002.202.125Search in Google Scholar

[13] D. R. Taunt, On 𝐴-groups, Proc. Cambridge Philos. Soc. 45 (1949), 24–42. 10.1017/S0305004100000414Search in Google Scholar

Received: 2023-05-18
Revised: 2023-11-03
Published Online: 2024-02-02
Published in Print: 2025-01-01

© 2024 Walter de Gruyter GmbH, Berlin/Boston

Downloaded on 16.9.2025 from https://www.degruyterbrill.com/document/doi/10.1515/jgth-2023-0076/html
Scroll to top button