On finite groups whose power graph is claw-free
Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Structural characterization of families of graphs (05C75) Finite simple groups and their classification (20D05) Finite nilpotent groups, (p)-groups (20D15) Arithmetic and combinatorial problems involving abstract finite groups (20D60)
The power graph \(\mathscr{P}(G)\) of a group \(G\) is the graph whose vertices are the elements of \(G\) with an edge between two distinct elements \(x\) and \(y\) if one is a power of the other, that is, \(x = y^m\) or \(y = x^n\) for some \(m,n \in \mathbb{N}\). The reduced power graph \(\mathscr{P}^{\ast}(G)\) is the subgraph of \(\mathscr{P}(G)\) induced on \(G \setminus \{1\}\), where \(1\) denotes the identity element of \(G\). A graph is said to be claw-free if it does not contain an induced subgraph isomorphic to the claw \(K_{1,3}\).\N\NThe first main result is Theorem~1.3, where the authors prove that if \(G\) is a finite solvable group and \(\mathscr{P}^{\ast}(G)\) is claw-free, then \(|\pi(G)| \leq 4\). The authors then consider the case of non-solvable groups and show that if \(\mathscr{P}^{\ast}(G)\) is claw-free, then \(G\) must be isomorphic to either \(\mathrm{PSL}(2,q)\) or \(\mathrm{PGL}(2,q)\), for suitable values of \(q\) (Theorem~1.4). From this classification, they deduce Theorem~1.5, which asserts that if \(\mathscr{P}^{\ast}(G)\) is claw-free, then \(|\pi(G)| \leq 5\).
- A survey on enhanced power graphs of finite groups
- Characterizations of derived graphs
- Classification of Finite Groups with all Elements of Prime Order
- Directed graphs and combinatorial properties of semigroups
- Endliche Gruppen I
- Finite group theory.
- Finite Groups in Which Every Element Has Prime Power Order
- Finite quaternion-free 2-groups.
- Forbidden subgraphs of power graphs
- Graphs defined on groups
- Groups of prime power order. Vol. 1.
- scientific article; zbMATH DE number 3906699 (Why is no real title available?)
- scientific article; zbMATH DE number 3620120 (Why is no real title available?)
- scientific article; zbMATH DE number 1522659 (Why is no real title available?)
- Line graph characterization of power graphs of finite nilpotent groups
- Maximum matching and a polyhedron with 0,1-vertices
- Non-nilpotent graph of a group.
- On a class of doubly transitive groups
- On finite groups whose power graph is a cograph
- On Groups all of Whose Elements Have Prime Power Order
- On maximal independent sets of vertices in claw-free graphs
- On power graphs of finite groups with forbidden induced subgraphs
- On quaternion-free 2-groups
- On the connectivity of proper power graphs of finite groups
- On the difference of the enhanced power graph and the power graph of a finite group
- On the soluble graph of a finite group
- Power graphs: A survey
- Recent developments on the power graph of finite groups -- a survey
- Some results and questions related to the generating graph a finite group.
- The characterisation of the Suzuki groups by their Sylow 2-subgroups
- The diameter of the commuting graph of a finite group with trivial centre.
- The independence graph of a finite group
- The maximal subgroups of the Chevalley groups \(G_ 2(q)\) with q odd, the Ree groups \(2G_ 2(q)\), and their automorphism groups
- The power graph of a finite group. II.
- Undirected power graphs of semigroups
This page was built for publication: On finite groups whose power graph is claw-free
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7028874)
