On finite groups whose power graph is a cograph
From MaRDI portal
Publication:2247752
Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graph operations (line graphs, products, etc.) (05C76) Simple groups: alternating groups and groups of Lie type (20D06) Arithmetic and combinatorial problems involving abstract finite groups (20D60) Finite simple groups and their classification (20D05)
Abstract: A -free graph is called a cograph. In this paper we partially characterize finite groups whose power graph is a cograph. As we will see, this problem is a generalization of the determination of groups in which every element has prime power order, first raised by Graham Higman in 1957 and fully solved very recently. First we determine all groups and for which the power graph of is a cograph. We show that groups whose power graph is a cograph can be characterised by a condition only involving elements whose orders are prime or the product of two (possibly equal) primes. Some important graph classes are also taken under consideration. For finite simple groups we show that in most of the cases their power graphs are not cographs: the only ones for which the power graphs are cographs are certain groups PSL and Sz and the group PSL. However, a complete determination of these groups involves some hard number-theoretic problems.
Recommendations
- Classification of non-solvable groups whose power graph is a cograph
- A combinatorial characterization of finite groups of prime exponent
- On power graphs of finite groups with forbidden induced subgraphs
- Forbidden subgraphs of power graphs
- Certain properties of the power graph associated with a finite group.
Cites work
- scientific article; zbMATH DE number 3906699 (Why is no real title available?)
- Criterion of unrecognizability of a finite group by its Gruenberg-Kegel graph
- Directed graphs and combinatorial properties of semigroups
- Finite Groups in Which Every Element Has Prime Power Order
- Finite Groups with Nilpotent Centralizers
- Forbidden subgraphs of power graphs
- Graph Classes: A Survey
- Maximal subgroups of \(G_2(2^n)\)
- Number Theory
- On a class of doubly transitive groups
- On the connectivity and independence number of power graphs of groups
- On the connectivity of proper power graphs of finite groups
- On the punctured power graph of a finite group
- On the structure of the power graph and the enhanced power graph of a group
- Power graphs: A survey
- The Finite Simple Groups
- The maximal subgroups of \({}^ 2F_ 4(q^ 2)\)
- The maximal subgroups of the Chevalley groups \(G_ 2(q)\) with q odd, the Ree groups \(2G_ 2(q)\), and their automorphism groups
- The maximal subgroups of the Steinberg triality groups \(3D_ 4(q)\) and their automorphism groups
- The power graph of a finite group
- The power graph of a finite group. II.
- The power graph of a torsion-free group
- Undirected power graphs of semigroups
- Vertex connectivity of the power graph of a finite cyclic group
Cited in
(8)- Finite groups whose intersection power graphs are toroidal and projective-planar
- Finite groups satisfying the independence property
- On groups with chordal power graph, including a classification in the case of finite simple groups
- Almost controllable graphs and beyond
- Classification of non-solvable groups whose power graph is a cograph
- A note on the power graph of a finite group
- SQUARE ROOT PRIME DIVISORS GRAPH OF A FINITE GROUP
- Forbidden subgraphs of co-prime graphs of finite groups
This page was built for publication: On finite groups whose power graph is a cograph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2247752)