WorksMathematics
Generalized Power Graph of a Group
Abstract
In this paper, we introduce a new class of graphs, called generalized power graphs, and investigate some of their key properties, such as completeness, connectivity, and planarity.
Introduction
The concepts of directed and undirected power graphs of a group were introduced by Kelarev and Quinn [16] and Chakrabarty et al. [8], respectively, and have since attracted considerable interest (see for instance [1, 2, 9, 10, 17, 19]). For the reader’s convenience, we shortly define these two types of graphs. The directed power graph of a group is the directed graph with vertex set , in which there is a directed edge from to if and for some positive integer . The undirected power graph of is the undirected graph obtained from by ignoring edge directions. The proper power graph of is the undirected power graph without identity element of a group .
An element of a group is called a generalized torsion element if a finite product of its conjugates equals the identity. We say that is a generalized torsion group if all of its elements have this property. It is immediate that any torsion element is a generalized torsion element. Although the converse holds for many important classes of groups (cf. [3, 4, 5, 15]), there exist infinite groups containing non-torsion elements that are nevertheless generalized torsion. For instance, consider the non-torsion elements of the infinite dihedral group.
Investigating generalized torsion elements provides important insights into combinatorial group theory and topology because they serve as a primary obstruction to bi-orderability. Indeed, if a group admits a bi-invariant order, then any finite product of conjugates of a positive element remains strictly positive. Consequently, every bi-orderable group is necessarily free of generalized torsion. This connection has motivated the study of generalized torsion and has established it as an active area of research (cf. [3, 4, 5, 12, 13, 14, 15]).
Given that graphs constructed from algebraic objects often reflect the structural properties of the underlying system, following [8, 16], we introduce the following classes of graphs. The generalized directed power graph of a group is the directed graph with vertex set , where for any , there is a directed edge from to (denoted or ) if and can be expressed as a finite product of conjugates of . That is, if there exist such that
where denotes the conjugate of by . The generalized undirected power graph (or generalized power graph, for short) of a group is the undirected graph obtained from by ignoring edge directions. The proper generalized directed (resp., undirected) power graph of , denoted by (resp., ), is the induced subgraph obtained from (resp., ) by deleting the vertex corresponding to the identity element.
2020 Mathematics Subject Classification. 05C25; 05C40; 05C10; 05C12; 20D15; 20F50; 20E45.
Key words and phrases. Power graph; Generalized power graph; generalized torsion; complete graph; connected graph; planar graph.
Let denote the symmetric group on three letters. The image below illustrates the generalized directed power graph, the proper generalized directed power graph, and the proper generalized undirected power graph of , respectively.

Figure 1.
Given that every non-trivial element is adjacent to the identity in the generalized power graph of a generalized torsion group, our results are mainly devoted to the proper generalized power graph.
The paper is organized as follows. In Section 2, we present general results regarding generalized power graphs. Sections 3 and 4 are devoted to investigating the completeness and connectedness of the generalized power graph of some families of finite and infinite groups. Finally, in Section 5, we give necessary and sufficient conditions for the planarity of the proper generalized power graph of a finite group.
General Properties
Let and be elements in a group . We say that there exists a path connecting and if there exist elements such that and are adjacent for all .
For non-empty subsets , we write if for all and . We may also write to mean that and .
We denote the conjugacy class of in by , the order of and its centralizer by . Furthermore, , , , , and denote the cyclic group of order , the dihedral group of order , the quaternion group of order 8, the complete graph on vertices, and the complete bipartite graph, respectively.
We define commutators of weight in the variables recursively as formal bracket expressions. The variables are commutators of weight 1, and commutators of weight 2 take the form . If and are commutators of weight and , respectively, then is a commutator of weight . If is a commutator of weight , we view it primarily as a function of variables defined on a group . Any value of in is called a commutator in (of weight ).
Throughout this paper, the following properties may be used without explicit reference.
Lemma 2.1. Let elements of a group .
(1) If , then .
(2) If and , then .
(3) .
(4) If for some , then .
If additionally is a torsion element, we obtain the following results:
(5) If and , then .
(6) If , then for every .
(7) and .
(8) If is any entry of some commutator , then .
Proof. (1) There exist elements such that and . Hence,
showing that .
(2) There exist elements such that and . Hence, , showing that .
(3) Let . There exist such that and . Thus, , which means . By a similar argument, we obtain .
(4) Note that implies . Applying Item (3), we obtain , and the result follows from Item (1).
(5) Since is torsion and , we have . Thus, the result follows by Item (4).
(6) By Bézout’s identity, there exist integers and such that . Thus, , and so . This implies that .
(7) If has finite order , then also has order and, consequently, and .
The second part follows from the fact that, for any integer , we have . Setting , we have , which means .
(8) We proceed by induction on the length of the commutator . Let be the order of . If has length , then or . In the first case, we have , and thus . The second case is similar. Now assume the result holds for any commutator of length less than , and let be a commutator of length . Then , where and are commutators of lengths and , respectively, satisfying . Furthermore, appears as an entry in at least one of the words . Without loss of generality, assume that is an entry of . By the induction hypothesis, we have , which means for some . Thus,
This shows that .
We note that if is complete, then is a generalized torsion group. Furthermore, if is a generalized torsion group, then is complete if and only if is complete. Obviously, we cannot replace “complete” with “connected” (as shown by ).
Lemma 2.2. Let be a group.
(1) If is complete (resp. connected), then is complete (resp. connected) for every direct factor of $G.
(2) If is complete, then is complete for every normal subgroup of .
Proof. (1) Let be a direct factor of . Thus, there exists a subgroup such that . Identify with the subgroup , and choose non-trivial elements. Since is complete, we may assume without loss of generality that . Thus, there exist elements such that
which implies that . Consequently, is complete. The connectedness part follows directly from the fact that if and is adjacent to , then either and , or and .
(2) Let be non-trivial distinct elements of . Since is complete, we have or . Assume, without loss of generality, that . Then there exist elements such that . Projecting this equality onto the quotient , we obtain , which completes the proof.
Note that in Lemma 2.2 (2), we cannot replace “complete” with “connected”. For instance, the proper generalized power graph of the quaternion group is connected, but has a quotient isomorphic to the Klein four-group, whose proper generalized power graph is disconnected.
Remark 2.3. As shown in [7], any two finite abelian groups with isomorphic proper power graphs must be isomorphic. However does not imply , even when and are nilpotent. Indeed, consider the quaternion group and the dihedral group .
Further, the same holds if we replace “nilpotent” with “finite simple”, because the proper generalized power graph of a finite simple group is complete and there exist pairs of non-isomorphic finite simple groups of the same order, such as and .
Completeness
In this section, we present several results concerning the completeness of the (proper) generalized power graph. We begin with the following result, which characterizes all abelian groups whose generalized power graph is complete.
Throughout this paper, the Prüfer -group is denoted by , where is a prime.
Lemma 3.1. Let be an abelian group. Then is complete if only if , where .
Proof. Since coincides to power graph of , the result follow by [8 Theorem 2.12] and [2 Theorem 1]. □
In the non-abelian case, the situation becomes much more interesting. For example, is complete if or (cf. § 1 and Example 3.4), whereas is not complete for any nonabelian group of order 8 (see Figure 2a and Figure 2b in Remark 2.3). We begin by proving the following result.

Figure 2. Proper Generalized Power Graphs of and .
Lemma 3.2. If is a finitely generated nilpotent group such that is complete, then must be a finite -group.
Proof. First, we show that must be a finite group. We proceed by induction on the nilpotency class of , denoted by . If , the result follows directly from Lemma 3.1. Assume . Combining Lemma 2.2 (2) with the induction hypothesis, we deduce that the central quotient is a finite group. By Schur’s Theorem [20 10.1.4], the derived subgroup is finite. Lemmas 2.2 (2) and 3.1 ensure that the abelian quotient is a finite -group, which implies that is finite. Thus, decomposes as a direct product of its Sylow -subgroups, say . Suppose for a contradiction that and that is complete. Consider the non-trivial elements and in . Since is complete, and must be adjacent, say . Then there exist elements such that . Consequently , which is a contradiction. Therefore, , and is a -group for some prime .
Example 3.3. Let be the dihedral group of order . We show that is complete if and only if for an odd prime and a positive integer . Indeed, for every element , we have . Consequently, if is complete, then the proper power graph is also complete. According to [8 Theorem 2.12], this occurs only when for some prime and some positive integer .
If is an odd prime, all elements belong to the same conjugacy class , and , which implies the completeness of .
If , it suffices to observe that the vertices and are not adjacent. Indeed, this follows from the fact that and .
Example 3.4. The graph is complete. Indeed, the four conjugacy classes of the alternating group are: , , and . Observe that and . Thus, Lemma 2.1 (4) implies that . Combining items (1) and (3) from Lemma 2.1, we obtain that is complete.

Figure 3. Proper Generalized Power Graph of
Lemma 3.5. If is a torsion simple group, then is complete.
Proof. If is abelian, we can deduce that has prime order. Thus, the result follows from Lemma 3.1. Now, assume that is nonabelian. Let and be arbitrary non-trivial elements of . Since is simple, we have , which implies that for some . Since is a torsion group, for some positive integer , which shows that . This completes the proof. □
Remark 3.6. Completeness is hereditary under direct summands and quotients, as shown in Lemma 2.2. However, it is not hereditary under taking subgroups. Indeed, while Lemma 3.5 ensures that is complete, the alternating group contains the Klein four-group as a subgroup, whose corresponding graph is not complete by Lemma 3.1.
As a consequence of Lemma 3.5, we obtain the following result.
Theorem 3.7. Every finite group can be embedded into a finite group such that is complete.
Proof. It is sufficient to show that is complete for all integers . Let . We prove that or by analysing the following cases:
Case 1:
Since is a nonabelian simple group for , Lemma 3.5 applies.
Case 2: and
First, suppose that . Observe that , and by Lemma 3.5, . Hence, there exist such that
which shows that .
Now suppose that . If , since has index in , we get that either , which implies , or , which implies . Both cases yield a contradiction. Thus, there exists an element such that . This implies that . By Lemma 3.5, we have . The result follows by applying Lemma 2.1(1).
Case 3: and
Repeating the argument used in the proof of Case 2, we obtain .
Case 4:
Since , by Case 2, we have . Thus, there exist such that
Let be the order of . Multiplying the right-hand side of the equality by , we get
which proves that . This completes the proof. □
Theorem 3.8. Let be a free group on countably many generators. Then is not complete.
Proof. By Lemma 3.1 we can assume that the rank of is at least . Assume by contradiction that is complete. By Lemma 2.2(2), is complete as well. However, is isomorphic to Cartesian product of copies of what is a contradiction (by Lemma 3.1). □
Corollary 3.9. If has any factor direct or quotient which is isomorphic to free group on countably many generators, then is not complete.
Proof. This follows immediately from the above theorem together with Lemma 2.2. □
The next lemma is probably well-known but we do not have a reference to it.
Lemma 3.10. A finite group satisfies exactly one of the following conditions:
is metacyclic; or
is non-metacyclic and contains a subgroup isomorphic to either (for some prime ) or quaternion group of order eight .
Proof. Assume that is non-metacyclic and that contains no subgroup isomorphic to for any prime . Since is non-metacyclic, it follows from [11 Theorem 7.6.2] that some Sylow -subgroup of is non-cyclic. Let be such a subgroup. This possesses a central subgroup of order . Furthermore, this central subgroup is necessarily unique, otherwise would contain a copy of . Hence, by Burnside’s theorem (cf. [20 5.3.6]), admits a subgroup isomorphic to the quaternion group .
Recall that a Dedekind group is a group in which all subgroups are normal. We show the following result.
Proposition 3.11. (1) If is a Dedekind group, then is complete if only if , where .
(2) If is a finite group which is complete for every proper subgroup and quotient of , then:
(a) is cyclic of order for some different primes and ;
(b) is cyclic of order power of a prime;
(c) is metacyclic and is an extension of by , for some primes and positive integers .
Proof. (1) By [20 5.3.7], a group is Dedekind if and only if it is either abelian or isomorphic to the direct product , where is a torsion abelian group. If is abelian, then the result follows by Lemma 3.1. Now assume that . It follows from Lemma 2.2 (1) that if is complete, then must also be complete. However, is not complete. Therefore, in this case, cannot be complete.
(2) If is non-metacyclic, then by Lemma 3.10, contains a subgroup isomorphic to either or . Thus, combining Item (1), Lemma 3.1 and Lemma 2.2 (2), we get a contradiction. Now, assume that is metacyclic. If is cyclic, then , where and are pairwise distinct primes. It follows from Lemma 3.1 that is either of prime-power order or of order for distinct primes and . Assuming that is not cyclic, there exists be such that both and are non-trivial cyclic. By Lemma 3.1, and have prime-power orders, say and , respectively. This completes the proof.
The structure of the -subgroups of a finite group can reveal significant information about the group itself. For instance, Lucchini proved in [18] that if every -subgroup of a group can be generated by at most elements for every prime dividing the order of , then every subgroup of can be generated by at most elements. This insight naturally motivates the following problem.
Problem 3.12. Let be a finite group and let be a graph property. If satisfies for every -subgroup of and every prime dividing the order of , what can be said about the structure of ?
We establish the following result.
Proposition 3.13. Let be a group satisfying the hypothesis of Problem 3.12, where is the property of being complete. Then is metacyclic.
Proof. If is non-metacyclic, then by Lemma 3.10, contains a subgroup isomorphic to either for some prime or the quaternion group . However, this contradicts the hypothesis in view of Lemmas 3.11 (1) and 3.1. The proof is complete.
We end this section with the following problem.
Problem 3.14. Can we characterize all finite groups for which is complete?
Connectivity
Let be the elementary abelian -group for some prime . It is straightforward to verify that the element is an isolated vertex in the graph . Hence, this graph is disconnected. However, the following result shows that every proper generalized power graph of a finite group whose center is not a -group is connected.
Theorem 4.1. If is a finite group such that is not a -group, then is connected with diameter at most 4.
Proof. First, assume that is a finite abelian group. Since coincides with the proper power graph of when is abelian, the connectedness statement follows from [10 Theorem 2.4]. For the reader’s convenience, we provide a detailed proof below.
Let be a prime dividing the order of . By the Fundamental Theorem of Finite Abelian Groups, we can write , where is a -group and is a non-trivial -group of order .
Consider satisfying
By Bezout’s lemma, there exist integers and such that . Consequently,
Thus, the vertex is connected to and . Similarly, is connected to and , and is connected to and . Hence, we have the path
which yields a path of length four between and , which concludes the proof for the abelian case.
Now, assume that is a finite nonabelian group. Let and be non-trivial elements of . If , then by Lemma 2.1(8) we have , which yields a path of length two between and . Thus, we may assume that and commute. Consider the subgroup , which is abelian. By assumption, is not a -group, implying that is connected with diameter at most 4. This completes the proof. □
Next, we establish the following result.
Theorem 4.2. (1) If is a torsion group with trivial center, then is connected with diameter at most 4.
(2) If is a finite group with a cyclic center, then is connected with diameter at most 4.
Proof. (1) Let and be non-trivial elements of . If and do not commute, then by Lemma 2.1(8) we get . Suppose now that and commute. Since neither element is central, there exist elements such that does not commute with and does not commute with . By Lemma 2.1(8) again, if either does not commute with or does not commute with , then and are connected by a path of length at most 4. Otherwise, commutes with and commutes with . In this case, applying commutator calculus (cf. [20 5.1.5 (ii)]), we obtain the following path
(2) If is not a -group, then Theorem 4.1 applies and the proof is complete. Hence, we may assume that is a -group. Repeating the above argument, we obtain a path of length at most 5 between any two non-central elements. Furthermore, since the center of is cyclic, say , any two elements of are connected by a path of length at most 2. Suppose that there exists an element whose order is coprime to . The subgroup is not a -group. By Theorem 4.1, there exists a path of length at most 4 connecting to any element of . Therefore, it remains to consider the situation where itself is a -group. In this case, let be such that is non-central and is central, and set , the normal closure of . If , then by Lemma 2.1 (5) every element of is adjacent to in . If , since is nilpotent, we have . Choosing a non-trivial element in this intersection, we obtain the following path connecting and
This completes the proof.
Note that the previous theorem ensures that the proper generalized power graph of groups such as the Gupta-Sidki, Grigorchuk, and Tarski monster groups is connected.
Problem 4.3. Can the “finite group” hypothesis be replaced with “torsion group” in Item (2) of Theorem 4.2?
In view of the two preceding theorems, it remains to consider the case where the center is a non-cyclic -group. To this end, we present a finite group with such a center for which is disconnected.
Example 4.4. Let be the direct product of the dihedral group and the cyclic group . We claim that is an isolated vertex of . Indeed, the center of , given by , is isomorphic to the Klein four-group. It is straightforward to observe that if is adjacent to , then . In this case, there exist elements such that
Consequently, , is odd, and . Since , the element must be non-central. Thus, belongs to one of the following conjugacy classes:
However, any two elements within the same conjugacy class commute. Thus, no such element exists, which implies that is disconnected. Direct calculations show that the graph can be represented as follows:
Figure 4 (PDF p. 10).
Theorem 4.5. Let be an integer and be the special linear group of degree over a field . Then is connected.
Proof. Assume that or , and let be a non-scalar matrix. By [23], every element in is a product of conjugates of , and so . Thus, in order to complete the proof, it is sufficient to show that is connected when and . The first case, , follows from Theorem 4.2 (1) because . Now, we will deal with the case . Here, has order 24 and contains a normal subgroup isomorphic to the quaternion group . By Theorem 4.2 (2) (or the figure in Remark 2.3), is connected. Further, has exactly four Sylow 3-subgroups, generated respectively by the matrices
Since all Sylow 3-subgroups are conjugate, all elements of order 3 are connected. Consider arbitrarily a non-trivial element in . Note that . If , then is connected to all elements in . If , then is contained in some 3-Sylow subgroup. Further, the commutator has order 4, and thus is connected to all elements in . By Lemma 2.1 (8), . This shows that every non-trivial element of is connected to all non-trivial elements of . This completes the proof. □
Theorem 4.6. (1) Let be a finite group of odd order satisfying the hypothesis of Problem 3.12, where is the property of being connected. Then is metacyclic.
(2) If is a finite group such that is connected for every proper subgroup of and every , then is metacyclic.
Proof. (1) Assume that is a non-metacyclic group. Since has odd order, Lemma 3.10 implies that contains a subgroup isomorphic to for some prime . However, because is not connected, this yields a contradiction.
(2) Suppose that is a non-metacyclic group. Lemma 3.10 implies that contains a subgroup isomorphic to for some prime or to a generalized quaternion group. First, assume that is a -group for some prime . If , our assumption implies that has a unique subgroup of order 2. By [20 5.3.6], is either cyclic or a generalized quaternion group, yielding a contradiction in both cases. If is odd, Lemma 3.10 implies that contains a subgroup isomorphic to , which is again a contradiction.
Now, assume that is not a -group. By Item (1), we may assume that has even order. Furthermore, it follows from [20 5.3.6] that every Sylow subgroup of odd order in is cyclic, and every Sylow -subgroup is either cyclic or a generalized quaternion group. Let be a Sylow -subgroup of . If is cyclic, then [11 Theorem 7.6.2] implies that is metacyclic, a contradiction. Consequently, is a generalized quaternion group. But , which is a contradiction. This completes the proof.
Planarity
In this section, we provide necessary and sufficient conditions for the planarity of the proper generalized power graph of a finite group . More precisely, we prove the following result.
Theorem 5.1. Let be a non-trivial finite group. Then is planar if and only if one of the following conditions holds:
, for some integer ;
, for some integer ;
, where either or ;
, for some non-negative integers and , not both zero;
is a non-abelian group of exponent that is a central extension of by for some positive integer .
To prove the Theorem 5.1, we first establish several auxiliary lemmas.
Lemma 5.2. The graph is non-planar.
Proof. Consider the additive group . Let , , and be elements of order , and let , , and be elements of order . For each , define . Note that and , which implies that for each pair there exists a path . Consequently, the graph contains a subdivision of . By Kuratowski’s theorem [6 Theorem 9.10, p. 153], is non-planar, which completes the proof. □
Let be a set of prime numbers. Recall that a group is called a -group if every non-trivial element in has an order whose prime factors belong to .
Lemma 5.3. Let be a non-trivial finite group such that is planar. Then is a metabelian -group and every conjugacy class of has size at most .
Proof. Suppose there exists a prime dividing the order of . Then, by Cauchy’s Theorem, contains a cyclic subgroup of order . Consequently, . Since , it follows that contains as a subgraph. By Kuratowski’s Theorem, is non-planar, which implies that must be a -group.
Now let be a non-trivial element of . If , then by Lemma 2.1 (3), again contains as a subgraph, contradicting planarity. Hence, we have that every conjugacy class of has size at most . Under this assumption, it follows from [22 Theorem 5.6 and Section 6] that the derived subgroup is abelian, completing the proof. □
Lemma 5.4. Let be a finite group containing an element with at least three conjugates. If is planar, then . Furthermore, is isomorphic to , the Klein four-group.
Proof. First, suppose that is adjacent to some element with . We claim that is a central element of order . Indeed, if , then . By Lemma 2.1 (3) and (4), every element in is adjacent to every element in and thus is a subgraph of , which contradicts Kuratowski’s theorem. Therefore, . Furthermore, if , then every element in is adjacent to every element in , which again yields that is a subgraph of , reaching a contradiction.
Now, suppose that there exist distinct non-trivial elements with , adjacent to . Lemma 2.1(3) and (4) imply that is a subgraph of , again contradicting planarity. Thus, the order of can only be , , or . If , then there exist two central involutions such that . Since divides , the subgroup contains an element of order ; because and are involutions, must have order . However, no group of order contains two central involutions (or three elements of order ), so . If we suppose that , there exists a central involution , which contradicts Lagrange’s theorem. Thus, the order of must be . Since all elements in are conjugate and therefore have the same order, it follows that , which completes the proof. □
Lemma 5.5. Let be a finite group in which no element has more than conjugates, and some element has exactly conjugates. If is planar, then has some element of order .
Proof. It is sufficient to show that contains a subgroup of order . Let be an element with exactly conjugates, and consider , the normal closure of . It is clear that . Suppose, for a contradiction, that . Then there exists a non-trivial element . By Lemma 2.1(4), is adjacent to all elements of , implying that contains as a subgraph. By Kuratowski’s Theorem [6], is non-planar, contradicting our assumption. Thus, , completing the proof. □
Lemma 5.6. Let be a non-trivial finite group.
If is an extension of by , , then is abelian. Consequently, is non-planar.
If is an extension of by , , where , , then is non-planar.
Proof. We only present the proof of (1), since (2) follows similarly. By Sylow’s theorem, contains a unique Sylow -subgroup, which is therefore normal. Since its Sylow subgroups are normal and abelian with coprime orders, is an abelian group containing an element of order . The result then follows from [9 Theorem 4.2]. □
Proof of Theorem 5.1. First, suppose that is planar. By Lemma 5.3 we may assume henceforth that is a metabelian -group and every conjugacy class of has size at most . We prove this direction of the theorem by considering each case separately.
Case 1: Suppose that every conjugacy class has cardinality . In this case, is abelian. If has a non-trivial Sylow -subgroup, then by Theorem of [9], we have for some positive integer (since the existence of any other Sylow subgroup would force to contain a cyclic subgroup of order greater than ). Otherwise, , where and are Sylow -subgroups for , respectively (each possibly trivial). If , then for some . If , then has exponent dividing . If both are non-trivial, Theorem of [9] yields for positive integers . By Lemma 5.2, if and , then is non-planar. Thus, either or .
Case 2: Suppose that every conjugacy class has cardinality at most , and there exists an element with exactly two conjugates. By Theorem of [22], the derived subgroup is cyclic of order , say . Since for all in , we get that . Thus, we conclude that is nilpotent, and therefore it decomposes as the direct product of its Sylow subgroups. By [9 Theorem 4.2], the Sylow -subgroup of is trivial. Furthermore, [22 Theorem 5.6] also implies that the Sylow -subgroup of is trivial.
Since is nonabelian, it follows from [9 Theorem 4.2] that has exponent exactly . Thus, is an extension of by , for some integers and . Next, we show that . To this end, suppose by contradiction that . Firstly, note that if is a non-central element of , then for all . Since and , it follows that .
Now, set . Since , we have . Note that is a proper subgroup of , which implies that . If , then is abelian, a contradiction. Thus there exist . By previous paragraph, we have that and
Note that since is noncentral, , and are also noncentral. Thus, by the same argument as above, we have that , . Therefore, we conclude that
Consequently, is a subgraph of , a contradiction. Thus , which implies that has exponent 4 and is an extension of by for some integer .
Case 3: Suppose that every conjugacy class in has cardinality at most 3, and there exists an element with exactly 3 conjugates. By [22 Theorem 5.6], the derived subgroup is cyclic of order 3.
Let be the set of all elements in whose conjugacy classes have size 3. For each , set , and define the subgroup . Consider the quotient group . Note that every conjugacy class of has size at most 2. Further, its derived subgroup has order dividing 3.
Thereby, if there exists an element in with exactly 2 conjugates, then [22 Theorem 5.6] ensures that is cyclic of order 2, a contradiction. Hence, must be abelian, so , which implies . However, by Lemma 5.4, is a 2-group, yielding a final contradiction.
Case 4: Suppose that every conjugacy class in has cardinality at most 4 and there exists an element with exactly 4 conjugates. According to Section 6 of [22], the derived subgroup is isomorphic to , , or . Moreover, Lemma 5.5 implies that 5 divides the order of . Hence, by Theorem 4.2 of [9], we obtain for some integer . However, Lemma 5.6 [2] guarantees that is abelian and contains a cyclic subgroup of order 10, which contradicts Theorem 4.2 of [9].
Now, we provide a proof of the converse. If satisfies one of the first three conditions, then [9 Theorems 4.3 and 4.5] ensure that is planar. Theorem 2 of [2] implies that is planar if satisfies the conditions of item (4). Finally, assume that satisfies the conditions of item (5). Thus, there exists a central involution satisfying is elementary abelian 2-group. Since is nonabelian, we get . Consequently, for any pair of elements we get which implies that .
Assume that . We show that . Indeed, there exist elements satisfying
Since is a central involution, we have either or for some integer . Furthermore, since , it is straightforward to see that in both cases . This shows that if is not an isolated vertex, then its unique adjacent vertices are and . Up to isolated vertices, the graph can be represented as shown in the figure below.

Figure 5.
This completes the proof.
IA
Artificial intelligence (https://gemini.google.com/app) was used to assist with routine typesetting, figure generation, grammar checking, and phrasing. Apart from these minor editorial and illustrative uses, the text and results of this paper were entirely authored by the human authors.
Disclosure statement
The authors have no conflicts of interest to declare that are relevant to the content of this article.
Data sharing
Not applicable to this article as no datasets were generated or analyzed during the current study.
Funding
This work was partially supported by FAPEMIG (grant number RED-00133-21).
Acknowledgement
The second author acknowledges the Departamento de Matemática of the Universidade Federal de Minas Gerais for its excellent hospitality while this research was conducted.
(D. Silveira) Departamento de Ciências Exatas e Aplicadas, Universidade Federal de Ouro Preto, 35931-008 Ouro Preto, MG, Brazil
Departamento de Matemática, Universidade Federal Minas Gerais, 31270-901 Belo Horizonte, MG, Brazil
Email address: [email protected]
(Y. Contreras-Rojas) Departamento de Matemática, Universidade Estadual de Maringá 87020-900 Maringá, PR, Brazil
Email address: [email protected]
References
- [1]J. Abaway, A. Kelarev, and M. Chowdhury, Power graphs: a survey, Electron. J. Graph Theory Appl. 1 (2013), no. 2, 125–147.
- [2]A. Doostabadi, A. Erfanian, and A. Jafarzadeh, Some results on the power graphs of finite groups, Sci. Asia 41 (2015), no. 1, 73–78.DOI
- [3]R. Bastos and L. Mendonça, Generalized torsion elements in infinite groups, Proc. Amer. Math. Soc. 153 (2025), no. 12, 5171–5181.DOI
- [4]C. C. Schneider, and D. Silveira, Generalized torsion elements in groups, Arch. Math. (Basel) 122 (2024), no. 2, 121–131.DOI
- [5]R. Bastos and D. Silveira, Finiteness conditions and generalized torsion elements in groups, Comm. Algebra 54 (2026), no. 4, 1687–1697.DOI
- [6]J. A. Bondy and U. S. R. Murty, Graph Theory, Graduate Texts in Mathematics, vol. 244, Springer, London, 2008.
- [7]P. J. Cameron and S. Ghosh, The power graph of a finite group, Discrete Math. 311 (2011), no. 13, 1220–1222.DOI
- [8]I. Chakrabarty, S. Ghosh, and M. K. Sen, Undirected power graphs of semigroups, Semigroup Forum 78 (2009), no. 3, 410–426.DOI
- [9]G. Dhawlath and V. Raja, Some properties of proper power graphs in finite Abelian groups, Discrete Math. Algorithms Appl. 17 (2025), no. 8, 2550007.
- [10]A. Doostabadi and F. Farrrokhi D. Ghouchan, On the connectivity of proper power graphs of finite groups, Comm. Algebra 43 (2015), no. 10, 4305–4319.arxiv.org/abs/1401.6760
- [11]D. Gorenstein, Finite Groups, 2nd ed., AMS Chelsea Publishing, Providence, RI, 2007.
- [12]T. Ito, On a group whose generalized torsion elements are torsion elements, Comm. Algebra 52 (2024), no. 4, 1271–1276.arxiv.org/abs/2303.05726
- [13]T. Ito, K. Motegi, and M. Teragaito, Generalized torsion and decomposition of 3-manifolds, Proc. Amer. Math. Soc. 147 (2019), no. 11, 4995–5008.arxiv.org/abs/1811.07532
- [14]T. Ito, K. Motegi, and M. Teragaito, Generalized torsion for hyperbolic 3-manifold groups with arbitrary large rank, Bull. Lond. Math. Soc. 55 (2023), no. 3, 1203–1209.arxiv.org/abs/2112.00418
- [15]J. Kato and D. V. P. Silva, Generalized torsion in triangular matrix groups, preprint, arXiv:2606.10168, 2026.arxiv.org/abs/2606.10168
- [16]A. V. Kelarev and S. J. Quinn, A combinatorial property and power graphs of groups, Contributions to General Algebra, vol. 12, Verlag Johannes Heyn, Klagenfurt, 2000, pp. 195–200.
- [17]A. Kumar, L. Selvagonesh, P. J. Cameron, and T. T. Chelvam, Recent developments on the power graph of finite groups – a survey, AKCE Int. J. Graphs Comb. 18 (2021), no. 2, 65–94.DOI
- [18]A. Lucchini, A bound on the number of generators of a finite group, Arch. Math. (Basel) 53 (1989), no. 4, 313–317.DOI
- [19]A. R. Moghaddamfar, S. Rahbarivan, and W. J. Shi, Certain properties of the power graph associated with a finite group, J. Algebra Appl. 13 (2014), no. 7, 1450004.
- [20]D. J. S. Robinson, A Course in the Theory of Groups, 2nd ed., Graduate Texts in Mathematics, vol. 80, Springer-Verlag, New York, 1996.
- [22]J. Wiegold, Groups with boundedly finite classes of conjugate elements, Proc. Roy. Soc. London Ser. A 238 (1957), no. 1214, 389–401.DOI
- [23]D. Witte, Products of similar matrices, Proc. Amer. Math. Soc. 126 (1998), no. 4, 1005–1015.DOI
