Finite groups whose commuting graphs are line graphs
Combinatorics
2025-06-25 v1
Abstract
The commuting graph of a group is the simple undirected graph with group elements as a vertex set and two elements and are adjacent if and only if in . By eliminating the identity element of and all the dominant vertices of , the resulting subgraphs of are and , respectively. In this paper, we classify all the finite groups such that the graph is the line graph of some graph. We also classify all the finite groups whose graph is the complement of line graph.
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}
}