Combinatorial properties of power graphs of finite groups of prime order elements
From MaRDI portal
Publication:4959876
DOI10.1080/00927872.2019.1659284zbMath1437.05093OpenAlexW2979183386MaRDI QIDQ4959876
Publication date: 7 April 2020
Published in: Communications in Algebra (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00927872.2019.1659284
nilpotent groupscircumferencecliqueSylow \(p\)-subgroupspower graphelementary abelian \(p\)-groupsmaximal subgraphs
Extremal problems in graph theory (05C35) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Miscellaneous inequalities involving matrices (15A45)
Cites Work
- Unnamed Item
- Unnamed Item
- The power graph of a finite group
- The undirected power graph of a finite group.
- Graph derivatives
- Undirected power graphs of semigroups
- The classification of finite groups by using iteration digraphs
- The Spectra of power graphs of certain finite groups
- The power graph of a finite group, II
- Classification of Finite Groups with all Elements of Prime Order
- On Laplacian spectrum of power graphs of finite cyclic and dihedral groups
- Power graphs: A survey
- Groups, Graphs, and Fermat's Last Theorem