On the difference of the enhanced power graph and the power graph of a finite group
Abstract
The difference graph of a finite group D (G) is the difference of the enhanced power graph of G and the power graph of G, where all isolated vertices are removed. In this paper we study the connectedness and perfectness of D (G) with respect to various properties of the underlying group G. We also find several connections between the difference graph of G and the Gruenberg-Kegel graph of G. We also examine the operation of twin reduction on graphs, a technique which produces smaller graphs which may be easier to analyze. Applying this technique to simple groups can have a number of outcomes, not fully understood, but including some graphs with large girth.
Citation
Biswas , S , Cameron , P J , Das , A & Dey , H K 2024 , ' On the difference of the enhanced power graph and the power graph of a finite group ' , Journal of Combinatorial Theory, Series A , vol. 208 , 105932 . https://doi.org/10.1016/j.jcta.2024.105932
Publication
Journal of Combinatorial Theory, Series A
Status
Peer reviewed
ISSN
0097-3165Type
Journal article
Description
Funding: The first author is supported by the PhD fellowship of CSIR (File no. 08/155 (0086)/2020 − EMR − I), Govt. of India. The second author acknowledges the Isaac Newton Institute for Mathematical Sciences, Cambridge, for support and hospitality during the programme Groups, representations and applications: new perspectives (supported by EPSRC grant no. EP/R014604/1), where he held a Simons Fellowship. The third author acknowledges the funding of DST grant SR/F ST/MS − I/2019/41 and MT R/2022/000020, Govt. of India. The fourth author acknowledges SERB-National Post-Doctoral Fellowship (File No. PDF/2021/001899) during the preparation of this work.Collections
Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Related items
Showing items related by title, author, creator and subject.
-
Automorphism groups of countable algebraically closed graphs and endomorphisms of the random graph
Dolinka, Igor; Gray, Robert Duncan; McPhee, Jillian Dawn; Mitchell, James David; Quick, Martyn (2016-05) - Journal articleWe establish links between countable algebraically closed graphs and the endomorphisms of the countable universal graph R. As a consequence we show that, for any countable graph Γ, there are uncountably many maximal subgroups ... -
Criterion of unrecognizability of a finite group by its Gruenberg–Kegel graph
Cameron, Peter J.; Maslova, Natalia (2022-10-01) - Journal articleThe Gruenberg--Kegel graph Γ(G) associated with a finite group G is an undirected graph without loops and multiple edges whose vertices are the prime divisors of |G| and in which vertices p and q are adjacent in Γ(G) if ... -
Tournaments and even graphs are equinumerous
Royle, Gordon F.; Praeger, Cheryl E.; Glasby, S. P.; Freedman, Saul Daniel; Devillers, Alice (2023-03-01) - Journal articleA graph is called odd if there is an orientation of its edges and an automorphism that reverses the sense of an odd number of its edges and even otherwise. Pontus von Brömssen (né Andersson) showed that the existence of ...