English

Finite groups whose commuting graphs are line graphs

Combinatorics 2025-06-25 v1

Abstract

The commuting graph Γ(G){\Gamma(G)} of a group GG is the simple undirected graph with group elements as a vertex set and two elements xx and yy are adjacent if and only if xy=yxxy=yx in GG. By eliminating the identity element of GG and all the dominant vertices of Γ(G)\Gamma(G), the resulting subgraphs of Γ(G)\Gamma(G) are Γ(G)\Gamma^*(G) and Γ(G)\Gamma^{**}(G), respectively. In this paper, we classify all the finite groups GG such that the graph Δ(G){Γ(G),Γ(G),Γ(G)}\Delta(G) \in \{\Gamma(G), \Gamma^*(G), \Gamma^{**}(G)\} is the line graph of some graph. We also classify all the finite groups GG whose graph Δ(G){Γ(G),Γ(G),Γ(G)}\Delta(G) \in \{\Gamma(G), \Gamma^*(G), \Gamma^{**}(G)\} is the complement of line graph.

Keywords

Cite

@article{arxiv.2411.04495,
  title  = {Finite groups whose commuting graphs are line graphs},
  author = {Siddharth Malviy and Vipul Kakkar},
  journal= {arXiv preprint arXiv:2411.04495},
  year   = {2025}
}