WorksMathematics
Chordality of Enhanced Power Graphs of Finite Simple Groups: A Resolution of a Conjecture
Abstract
The enhanced power graph \PE(G) of a finite group has vertex set , two elements being adjacent if and only if they generate a cyclic subgroup. We determine the finite simple groups for which \PE(G) is chordal: they are the cyclic groups of prime order, \Alt(7), \PSL_2(q) (), \Sz(q) () and \PSL_3(4). This answers an open problem of Bubboloni, Fumagalli and Praeger \cite{BFP}. We also prove that for every finite group , if the power graph is a cograph (resp.\ chordal) then so is \PE(G); the cograph case is a conjecture of Bubboloni, Fumagalli and Praeger \cite{BFP}.
Introduction
For a finite group , the power graph joins when one lies in the cyclic group generated by the other, and the enhanced power graph joins when is cyclic; thus , with equality if and only if every element has prime-power order (EPPO groups) [1]. A graph is a cograph if it has no induced path , and chordal if it has no induced cycle of length .
Forbidden subgraph characterizations provide a powerful structural framework for investigating graphs defined on groups, revealing how the algebraic properties of a group govern the combinatorial structure of its associated graph. Forbidden induced subgraphs in have been studied by Manna–Cameron–Mehatari [13], Cameron–Manna–Mehatari [4] (simple groups with cograph power graph), Manna–Mehatari [15] and Brachter–Kaja [2] (simple groups with chordal power graph), Manna–Mandal–Lucchini [14] (claw-free power graph); the nilpotent case for is due to Ma–Zahirović–Lv–She [16]. Recently Bubboloni, Fumagalli and Praeger [3] proved that if is a cograph then it is chordal, classified the nonabelian simple groups with cograph (namely , , and ), showed that is chordal but not a cograph, and posed the problem of determining the simple groups with chordal . Moreover, in [7 §7] (see also [17]) the Kourovka problem 21.24 ( cograph chordal) is solved, and the conjecture of [3] that cograph implies cograph is recorded as open.
This paper makes two contributions.
Theorem 1.1 (Classification). Let be a finite simple group. Then is chordal if and only if is isomorphic to one of: a cyclic group of prime order; ; with (this includes , , ); with ; .
Theorem 1.2 (Lifting). Let be a finite group. If is a cograph then is a cograph; if is chordal then is chordal.
Together with [3] and [7, 17] we obtain, for every finite group ,
The principal contribution: By [3 Theorem B], the groups , , have cograph, hence chordal, , and is chordal; so the sufficiency half of Theorem 1.1 is already contained in [3] (we include direct proofs for completeness; , , , also follow from [2 Theorem 1.1] and Theorem 1.2). The new content is the necessity: every other simple group has non-chordal , which answers the chordal part of Open Problem 1 of [3]; in particular is the only simple group with chordal but non-cograph . Theorem 1.2 proves, for all finite groups, the cograph conjecture of [3], and its chordal version. The converses fail: is complete, whereas is not chordal (the elements of orders 6, 2, 10, 5, 15, 3 induce a , since adjacency in is divisibility of orders); and is not a cograph (elements 3, 6, 2, 4 of orders 4, 2, 6, 3 induce a ) while is complete. Within simple groups, contains a cyclic subgroup of order 30, so is not chordal, while is chordal (Prop. 4.1).
The negative half rests on one mechanism (Lemma 2.5): commuting elements of coprime prime-power orders with neither normal in nor normal in yield an induced even cycle; the positive half on a perfect elimination ordering by vertices lying in a unique maximal cyclic subgroup.
Organization: Section 2 collects fundamental concepts and results, Section 3 proves Theorem 1.2, Sections 4 and 5 treat chordal and non-chordal families, Section 6 assembles the proof of Theorem 1.1, and Section 7 records computer checks using GAP 4.12. Section 8 summarizes some well-known results and standard facts.
Preliminary Results
Throughout, we use the symbol to mean . We write if and or , and if and is cyclic. If then , so , and every non-edge of is a non-edge of . We write for “ is not normal in ”.
Lemma 2.1 (Subgroups and quotients). (a) If then is the induced subgraph of on ; so if is not chordal, neither is .
(b) If , and , then ; so if is not chordal, neither is .
Proof. Adjacency depends only on , giving (a); (b) is the isomorphism theorem and (a).
Lemma 2.2 (Universal vertex). The identity is adjacent to every vertex, so it lies on no induced cycle of length ; is chordal if and only if is.
Lemma 2.3 (EPPO groups [1]). If every element of has prime-power order, then and it is chordal.
Proof. If is cyclic of prime-power order its subgroups form a chain, so or . Let be an induced cycle of length and of maximal order; its neighbours on are comparable with and have order , so lie in ; subgroups of a cyclic -group form a chain, so they are adjacent, a contradiction.
Lemma 2.4 (Simplicial elimination [8]). A vertex is simplicial if its closed neighbourhood is a clique. If the vertices can be ordered so that each is simplicial in the subgraph induced on , the graph is chordal. In the closed neighbourhood of is the union of the cyclic subgroups containing ; if lies in a unique maximal cyclic subgroup then and is simplicial.
Proof. Let be an induced cycle of length and its first vertex in the order. Its two neighbours on lie in and are non-adjacent, so is not simplicial there.
Lemma 2.5 (Coprime commuting pairs). Let commute and have coprime prime-power orders . If and , then has an induced cycle of even length .
Proof. Let be the sets of -conjugates of and choose one generator for each member; these are the vertices of . Two distinct members of are non-adjacent because a cyclic group has at most one subgroup of order ; likewise for . A member of and one of are adjacent if and only if they commute (commuting elements of coprime orders generate a cyclic group). So is a bipartite induced subgraph of . The vertex is adjacent to every with , and there are of these; by conjugation every vertex of has degree , and symmetrically for . A finite graph of minimum degree has a cycle, a shortest cycle is induced, and in it has even length .
Lemma 2.6 (Quotient version). Let and . Let commute with of coprime prime-power orders. If there are and with and , then has an induced cycle of length .
Proof. and , so ; symmetrically for . Apply Lemma 2.5.
Lemma 2.7 (Numerical criterion). Let commute and have prime orders , and put . If and , then is not chordal.
Proof. If then embeds in , so . But divides , so this index is , a contradiction. The same holds for . Apply Lemma 2.5.
Lemma 2.8 (Direct products). Suppose , where has two distinct subgroups of prime order and has two distinct subgroups of prime order . Then is not chordal. This applies when are non-abelian simple, with , , (a subgroup of prime order in a simple group is not normal, hence has conjugates), and to and .
Proof. Take of order and of order with , . Then and , while every cross pair commutes and has coprime orders, hence is adjacent. So is an induced .
The lifting theorem
Proof of Theorem 1.2. We prove the contrapositive: if contains an induced cycle of length (resp. an induced ), so does .
Let be an induced subgraph of that is a cycle (, indices mod ) or a path (), with edges . Being induced and of length , has no triangle. Step 1. Let be the set of such that is an edge of but . For let generate the cyclic group ; then .
Step 2 (key observation (K)). Let and let be a vertex of . If or , then .
Indeed, if then and lie in the cyclic group ; if then and both groups equal . In either case equals or is -adjacent to each of . If this is a triangle in , which is impossible.
Step 3 (consequences).
(a) : if then , so by (K) ; but would give , contradicting .
(b) For in , (in particular and ): if then , so by (K) and .
(c) For and a vertex of : if and only if . The “if” holds as ; the “only if” is (K).
Step 4. Let arise from by replacing, for every , the edge by the path . By (a),(b) its vertices are distinct, and it is a cycle (resp. path) of length . We claim is an induced subgraph of .
Its edges are -edges: , by (c); for by definition of .
A pair that is not an edge of is non-adjacent in (hence in , hence in ), or equals with (non-adjacent in by definition of ).
A pair that is not an edge has and is non-adjacent by (c).
() is non-adjacent by (b).
Step 5. If is an induced cycle, is an induced cycle of length in . If is an induced , is an induced path on vertices of and any four consecutive vertices induce a .
Simple groups with chordal
The following facts are used; sources are listed in § 8.
Proposition 4.1 (PSL, ). is chordal, and in fact is a disjoint union of cliques; in particular is a cograph (cf. [3]).
Proof. Facts D (§ 8). Let be a Sylow -subgroup (); for . even. All involutions lie in Sylow 2-subgroups, and the tori have odd orders . Every is a 2-element, in , or lies in a torus with . odd. For an involution , is dihedral of order (), is its central involution and the rotation subgroup is cyclic of even order .
We show every lies in a unique maximal cyclic subgroup :
: a cyclic subgroup containing lies in , so has order and .
and : a cyclic subgroup containing lies in , so .
an involution, odd: a cyclic subgroup containing lies in . If a reflection is not central, so it lies in and . If () then and .
If is cyclic it lies in a maximal cyclic subgroup, which then equals and ; so , and is a disjoint union of cliques. Apply Lemma 2.2.
Proposition 4.2 (Sz). Let with . Then is chordal.
Proof. Facts S. Let be a Sylow 2-subgroup, .
Odd order. If is odd, neighbours of lie in , a cyclic torus, so is a clique.
Involution (note for every involution , and all involutions lie in ). A neighbour lies in . If and then is not cyclic. If then is the unique involution of , so .
Element of order 4. A neighbour lies in , so is with and ; if this contains . So .
Hence is the disjoint union of the cliques given by the tori (minus 1) and the components , each a union of triangles sharing the cut vertex . Every block is a clique, so there are no induced cycles of length ; apply Lemma 2.2. (Note that itself contains diamonds with , ; the block statement refers to .)
Proposition 4.3 (PSL(4)). is chordal.
Proof. The element orders of are (ATLAS), so it is EPPO; apply Lemma 2.3.
Proposition 4.4 (Alt(7)). is chordal.
Proof. The element orders are with 4, 5, 6, 7 occurring. A cyclic overgroup of an element of order 4, 5, 6 or 7 has order a multiple of it and at most 7, so equal to it; thus such elements lie in a unique maximal cyclic subgroup, are simplicial (Lemma 2.4), and may be removed first.
All involutions of are conjugate to , and has Sylow 3-subgroup (a subgroup of order 3 of lies in , where it is unique). In the remaining graph with , which is a clique ( is cyclic of order 6); so is simplicial and all involutions may be removed. What remains is together with the subgroups of order 3, triangles through 1; these eliminate in turn. By Lemma 2.4, is chordal.
Simple groups with non-chordal
Alternating groups
Proposition 5.1. is non-chordal for . Also is non-chordal for (only is used below, as an auxiliary group).
Proof. : take , . Then contains , which moves , and contains with . Lemma 2.5.
: take , . Then contains and is normal in the simple group . Also commutes with and . Lemma 2.5.
Larger : Lemma 2.1(a).
Linear groups
Let denote matrix units.
Lemma 5.2 (Central quotients of ). Let and . Then is non-chordal. (In particular and are non-chordal.)
Proof. Put , , and choose as follows.
odd: , of order ; since divides , so has order ; is odd.
: while , so has a prime divisor . Take of order and . Then , so is not scalar, has order , and .
Then commutes with and (its first two diagonal entries are equal), and because . Further with is not diagonal, so , a group of diagonal matrices. And has non-zero entry, whereas every element of is a scalar multiple of . Lemma 2.6 applies.
Proposition 5.3. is non-chordal for , , and for all and all .
Proof. is Lemma 5.2. Let and .
: the block meets trivially (a scalar in is on the identity block); Lemmas 5.2 (with ) and 2.1(b).
: meets trivially (a scalar in a block has , so ); Lemmas 2.8, 2.1(b).
: ; Prop. 5.1.
Symplectic groups
Let be a symplectic basis with , and a symplectic transvection; then and .
Proposition 5.4. For odd, and are non-chordal; for even, , is non-chordal; is non-chordal. (For the simple group is , which is chordal.)
Proof. : Prop. 5.1.
odd. Let on and on ; , , , . Since and we get ; as , so . Further , so the -eigenspace of is neither , nor ; hence . Finally , so is a non-trivial unipotent element with image line , while the unipotent elements of are or have image line . So . The elements have orders . By Lemma 2.6 with , is non-chordal. The same computation shows and , so Lemma 2.6 with shows that itself is non-chordal.
even, . with simple factors, and the centre is trivial. Lemma 2.8 with and an odd prime .
Proposition 5.5. is non-chordal for all and all .
Proof. meets the centre trivially (as is non-trivial on the identity block, of dimension ). By Prop. 5.4, is non-chordal for every (including , where ); apply Lemma 2.1(b).
Unitary groups
We use the Hermitian form with Gram matrix on ; bars denote . The direct computation of gives:
if and only if ; these form a group of order with centre ;
if and only if ;
if and only if , and .
Proposition 5.6. and are non-chordal for .
Proof. Let , of order ; the case gives . Choose with , and of prime-power order:
odd: ;
even, has a prime divisor : of order ;
even, : by Mihăilescu’s theorem ; take of order (then and has order ).
In every case (as ), so is not scalar and . Put with , ; is coprime to (for odd ; for even and is odd). Clearly .
Take with (exists since the trace is onto). As is central in , . The entry of is , so is not diagonal and .
Take with , ; it commutes with since , and
has entry , while every element of has entry 0. Apply Lemma 2.6.
Proposition 5.7. is non-chordal for all and all .
Proof. : the block meets the centre (scalars) trivially; Prop. 5.6, Lemma 2.1(b). , : and , non-chordal by Prop. 5.4. , : block .
Orthogonal groups
Let be the full isometry group of the quadratic form, and the usual subgroup: for the derived subgroup of ; equivalently the kernel of the spinor norm and determinant ( odd), resp. of the Dickson invariant ( even). In all cases is abelian (of order ), so contains every perfect subgroup of .
Proposition 5.8. Let be (), () or (). Then is non-chordal. (Orthogonal groups of lower rank are isomorphic to , , , , and are covered elsewhere.)
Proof. . Write the space as with totally singular of dimension (, for ; , for the type; , an anisotropic -space, for the type). The map embeds (acting on the first three coordinates of ) into ; the image is perfect, so . acts trivially on a non-zero subspace, so meets the centre of () trivially. By Lemma 5.2 with and Lemma 2.1(b), is non-chordal. (For odd and type the centre is trivial.)
. For use Prop. 5.5. For , the stabilizer in of a non-singular vector is ( the transvection with centre , which fixes as is even). The factor is perfect since , so it lies in ; it is non-chordal by Prop. 5.5. The centre is trivial for even. □
Exceptional groups and the Tits group
Proposition 5.9. is non-chordal for (), (), , , , (), the Tits group , , , , .
Proof. , . By Facts W, an involution has with ; contains an element of order 3 (as ), and . Then , so and . Lemma 2.7.
Containments (sources in Table 1): for , and (ATLAS); ; the Tits group contains (non-chordal by Lemma 5.2 as ) and (subfield subgroup); contains the subgroup generated by long-root subgroups of a subsystem of type , which is for some , non-chordal for by Lemma 5.2, whichever occurs; for even , non-chordal by Prop. 5.5, which covers . For (simple versions), let be the corresponding simply connected group; it contains a subgroup [2] (Dynkin sub-diagram of type for , via , and, for , as the fixed points of the graph automorphism) and with central. Since is simple non-abelian, , so embeds in (Lemma 2.1(b)); is non-chordal by the case. In all cases Lemma 2.1(a) transfers non-chordality to . □
Sporadic groups
Proposition 5.10. is non-chordal for every sporadic simple group .
Proof. Centralizer orders and class data below are checked with the GAP Character Table Library (§ 7).
: a class with , , , , ; , . Lemma 2.7.
: , , ; , . Lemma 2.7.
: the only class of elements of order 6 is , with , , , , ; , . Lemma 2.7.
@-end- төхөөр
: here , and , so and Lemma 2.7 fails; we use Lemma 2.5 instead. and . Take and an involution (which lies in and is non-central there), so ; and lies in the simple factor, so .
and (maximal subgroups): Lemma 2.8.
and (maximal subgroups): Prop. 5.9, Lemma 2.1(a).
Each of the remaining 19 groups (including itself) contains ; see Table 2.
| Group | Containment chain |
| itself | |
| , , , , , | (library class fusion) |
| , | |
| , | |
| lifts to | |
| lifts to | |
| lifts to | |
Table 2. Groups containing . Lifting through a central extension uses that is perfect with trivial Schur multiplier, so every central extension of splits. Direct fusions are confirmed in the GAP Character Table Library; the remaining steps are ATLAS maximal subgroups.
Proof of Theorem 1.1
By the classification of finite simple groups, is cyclic of prime order, alternating, of Lie type, or sporadic. Table 3 accounts for every family exactly once, including the isomorphisms with small cases and the non-simple small groups that must be excluded.
| Family | chordal? | Reference / remark |
| yes | complete graph | |
| yes | , | |
| yes | Prop. 4.4 | |
| no | Prop. 5.1; | |
| yes | Prop. 4.1; , ; ( not simple) | |
| yes | ||
| yes | Prop. 4.3 | |
| no | Lemma 5.2 | |
| no | Prop. 5.3 | |
| no | Prop. 5.6; ; ( not simple) | |
| no | Prop. 5.7; | |
| no | Prop. 5.4; | |
| yes | counted under | |
| no | Prop. 5.5 | |
| no | Prop. 5.8 | |
| yes | ||
| no | ||
| yes | Prop. 4.2; ( not simple) | |
| no | Prop. 5.9; | |
| no | Prop. 5.9; | |
| 26 sporadic groups | no | Prop. 5.10 |
Table 3. Every finite simple group is listed exactly once up to the displayed isomorphisms.
The groups with chordal are therefore exactly , , (), () and .
Remark 6.1. Comparison with [2]: is chordal for simple if and only if is , , , , , or , subject to arithmetic conditions: for , resp. and for , each have at most two prime divisors and at most one prime divisor of multiplicity . By Theorem 1.2 that list is contained in ours; the arithmetic conditions disappear for because in distinct maximal cyclic subgroups intersect trivially (Prop. 4.1) and in they intersect in at most an involution.
Computational verification
All checks are performed with GAP 4.12 (see [9]) (with the CTblLib package) and Python/NetworkX. Chordality of is tested by listing all cyclic subgroups of (so that is the union of the cliques they span).
is chordal for with , , and (order 20160).
is non-chordal for , , and (same method), in agreement with the proofs above.
The ATLAS data used in Proposition 5.10 (classes, centralizer orders, class 6A and its powers for ) are read from the GAP Character Table Library; the class fusions for the containments in Table 2 and in the proofs for and the Tits group are confirmed there, and the maximal subgroups and are confirmed from the library’s list of maximal subgroups.
Chordality for , , and the larger ; the containments in Table 1 and , taken from the cited literature and ATLAS.
| Containment | Source |
| (), | Kleidman (odd ), Cooperstein ( even), ATLAS |
| Kleidman (Steinberg triality groups) | |
| ATLAS; Wilson §4.9 | |
| , | Malle (subfield subgroups) |
| Gorenstein–Lyons–Solomon, Prop. 2.6.2; Brachter–Kaja, Lemma 2.3 | |
| , even | Wilson §4.9 |
| Brachter–Kaja [2], Lemma 2.3 (Dynkin sub-diagrams) |
Table 1. Subgroup containments used in Proposition 5.9; full references in § 8.
Standard facts used
Facts D (Dickson). For : a Sylow -subgroup is elementary abelian of order and self-centralizing on its non-identity elements; every -element lies in a cyclic torus of order which is the centralizer of each of its elements of order ; for odd the centralizer of an involution is dihedral of order , . Sources: Dickson [6]; Huppert [10 Kap. II, §8] (Hauptsatz 8.27); Wilson [21 §3.3].
Facts S (Suzuki). For , : a Sylow -subgroup has order , is elementary abelian of order and contains every involution, all elements of have order with square in ; for each involution and for ; elements of odd order have cyclic centralizers (the
orders , ), which intersect pairwise trivially. Sources: Suzuki [18, 19]; Huppert–Blackburn [11 Chap. XI, §3]; Wilson [21 §4.2].
Facts W (Ward). In , : and for an involution ; elements of order have centralizers of order or (when they commute with an involution). Sources: Ward [20]; Kleidman [12].
ATLAS [5]: element orders of and ; isomorphisms , , , , and the low-rank orthogonal isomorphisms (Wilson [21 §3.11]); maximal subgroup containments for sporadic groups; Mihăilescu’s theorem: only for .
Acknowledgments
The research of Pallabi Manna is supported by Anusandhan National Research Foundation (ANRF)-India under the National Postdoctoral Fellowship scheme (File No. PDF/2025/006751). The author would like to express sincere gratitude to Professor Andrea Lucchini for his valuable assistance in establishing Theorem 1.2 and for his careful review of the manuscript. The author also acknowledges the excellent research facilities provided by the Department of Mathematics, IIT Hyderabad, and the mentorship of Dr. Rajesh Kannan for his constant support and motivation.
Statements and Declarations
Competing Interests. The authors have no competing interests to declare that are relevant to the content of this article.
Data Availability
Data sharing is not applicable to this article, as no datasets were used or generated during this study.
References
- [1]G. Aalipour, S. Akbari, P. J. Cameron, R. Nikandish, F. Shaveisi, On the structure of the power graph and the enhanced power graph of a group, Electron. J. Combin. 24 (2017), Article No.-P3.16.arxiv.org/abs/1603.04337
- [2]J. Brachter, E. Kaja, On groups with chordal power graph, including a classification in the case of finite simple groups, J. Algebraic Combin. 58 (2023), 1095–1124.
- [3]D. Bubboloni, F. Fumagalli, C. E. Praeger, Enhanced power graphs of finite groups with cograph structure, Preprint: arXiv:2510.18073 (2025).arxiv.org/abs/2510.18073
- [4]P.J. Cameron, P. Manna, R. Mehatari, On finite groups whose power graph is a cograph, J. Algebra 591 (2022), 59–74.DOI
- [5]J.H. Conway, R.T. Curtis, S.P. Norton, R.A. Parker, R. A. Wilson, Atlas of Finite Groups, Clarendon Press, Oxford, 1985.
- [6]L.E. Dickson, Linear Groups with an Exposition of the Galois Field Theory, Teubner, Leipzig, 1901.
- [7]W. van Doorn, E. Judin, P. Monticone, D. Morrison, On some problems from the Kourovka Notebook, Preprint: arXiv:2607.17477 (2026).arxiv.org/abs/2607.17477
- [8]D. R. Fulkerson, O. A. Gross, Incidence matrices and interval graphs, Pacific J. Math. 15 (1965), 835–855.DOI
- [9]The GAP-Group, Algorithms and Programming, Version 4.12, 2022. Available at: http://www.gap-system.org.
- [10]B. Huppert, Endliche Gruppen I, Springer, Berlin, 1967.DOI
- [11]B. Huppert, N. Blackburn, Finite Groups III, Springer, Berlin, 1982.DOI
- [12]P.B. Kleidman, The maximal subgroups of the Chevalley groups G₂(q) with q odd, the Ree groups ²G₂(q), and their automorphism groups, J. Algebra 117 (1988), 30–71.DOI
- [13]P. Manna, Peter J. Cameron, R. Mehatari, Forbidden subgraphs of power graphs, Electron. J. Combin. 28 (2021).DOI
- [14]P. Manna, S. Mandal, A. Lucchini, On finite groups whose power graph is claw-free, Dis-crete Math. 348(4) (2025), Article No. 114348.arxiv.org/abs/2407.20110
- [15]P. Manna, R. Mehatari, On chordality of the power graph of finite groups, Preprint: arxiv.org/abs/2208.14879 (2022).arxiv.org/abs/2208.14879
- [16]X. Ma, S. Zahirović, Y. Lv, Y. She, Forbidden subgraphs in enhanced power graphs of finite groups, Preprint: arXiv:2104.04754 (2021).arxiv.org/abs/2104.04754
- [17]M. Rundström, Kourovka Notebook Problem 21.24, solution note (2026).
- [18]M. Suzuki, A new type of simple groups of finite order, Proc. Nat. Acad. Sci. U.S.A. 46 (1960), 868–870.pubmed.ncbi.nlm.nih.gov/16590684
- [19]M. Suzuki, On a class of doubly transitive groups, Ann. Math. (2) 75 (1962), 105–145.
- [20]H.N. Ward, On Ree’s series of simple groups, Trans. Amer. Math. Soc. 121 (1966), 62–89.
- [21]R. A. Wilson, The Finite Simple Groups, Springer, London, 2009.DOI