On finite groups whose power graph is a cograph

From MaRDI portal
Publication:2247752

DOI10.1016/J.JALGEBRA.2021.09.034zbMATH Open1478.05069arXiv2106.14217OpenAlexW3208305474MaRDI QIDQ2247752FDOQ2247752


Authors: Peter J. Cameron, Pallabi Manna, Ranjit Mehatari Edit this on Wikidata


Publication date: 17 November 2021

Published in: Journal of Algebra (Search for Journal in Brave)

Abstract: A P4-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 G and H for which the power graph of GimesH 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(2,q) and Sz(q) and the group PSL(3,4). However, a complete determination of these groups involves some hard number-theoretic problems.


Full work available at URL: https://arxiv.org/abs/2106.14217




Recommendations




Cites Work


Cited In (8)





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)