On the Difference Graph of power graphs of finite groups

DOI10.2989/16073606.2023.2278078MaRDI QIDQ6420610zbMATH OpenFDO

Authors Jitender Kumar, Ramesh Prasad Panda

Publication date 15 December 2022

Full work available at URL https://doi.org/10.2989/16073606.2023.2278078

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Arithmetic and combinatorial problems involving abstract finite groups (20D60)

Abstract: The power graph of a finite group $G$ is a simple undirected graph with vertex set $G$ and two vertices are adjacent if one is a power of the other. The enhanced power graph of a finite group $G$ is a simple undirected graph whose vertex set is the group $G$ and two vertices $a$ and $b$ are adjacent if there exists $cinG$ such that both $a$ and $b$ are powers of $c$. In this paper, we investigate the difference graph $mathcalD(G)$ of a finite group $G$, which is the difference of the enhanced power graph and the power graph of $G$ with all isolated vertices removed. We study the difference graphs of finite groups with forbidden subgraphs among other results. We first characterize an arbitrary finite group $G$ such that $mathcalD(G)$ is a chordal graph, star graph, dominatable, threshold graph, and split graph. From this, we conclude that the latter four graph classes are equivalent for $mathcalD(G)$. By applying these results, we classify the nilpotent groups $G$ such that $mathcalD(G)$ belong to the aforementioned five graph classes. This shows that all these graph classes are equivalent for $mathcalD(G)$ when $G$ is nilpotent. Then, we characterize the nilpotent groups whose difference graphs are cograph, bipartite, Eulerian, planar, and outerplanar. Finally, we consider the difference graph of non-nilpotent groups and determine the values of $n$ such that the difference graphs of the symmetric group $S_n$ and alternating group $A_n$ are cograph, chordal, split, and threshold.

Recommendations

• Some new results concerning power graphs and enhanced power graphs of groups
• On the difference of the enhanced power graph and the power graph of a finite group
• Forbidden subgraphs in enhanced power graphs of finite groups
• On the structure of the power graph and the enhanced power graph of a group

Cited in

(3)

• Forbidden subgraphs in enhanced power graphs of finite groups
• Some new results concerning power graphs and enhanced power graphs of groups
• On the difference of the enhanced power graph and the power graph of a finite group

This page was built for publication: On the Difference Graph of power graphs of finite groups

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