Forbidden subgraphs of power graphs

From MaRDI portal
Revision as of 19:27, 1 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:2040001

DOI10.37236/9961zbMATH Open1467.05115arXiv2010.05198OpenAlexW3182166453MaRDI QIDQ2040001FDOQ2040001

Pallabi Manna, Peter J. Cameron, Ranjit Mehatari

Publication date: 6 July 2021

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Abstract: The undirected power graph (or simply power graph) of a group G, denoted by P(G), is a graph whose vertices are the elements of the group G, in which two vertices u and v are connected by an edge between if and only if either u=vi or v=uj for some i, j. A number of important graph classes, including perfect graphs, cographs, chordal graphs, split graphs, and threshold graphs, can be defined either structurally or in terms of forbidden induced subgraphs. We examine each of these five classes and attempt to determine for which groups G the power graph P(G) lies in the class under consideration. We give complete results in the case of nilpotent groups, and partial results in greater generality. In particular, the power graph is always perfect; and we determine completely the groups whose power graph is a threshold or split graph (the answer is the same for both classes). We give a number of open problems.


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

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)




Cites Work


Cited In (19)






This page was built for publication: Forbidden subgraphs of power graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2040001)