English

Line graph characterization of the order supergraph of a finite group

Combinatorics 2023-10-09 v1 Group Theory

Abstract

The power graph P(G)\mathcal{P}(G) is the simple undirected graph with group elements as a vertex set and two elements are adjacent if one of them is a power of the other. The order supergraph S(G)\mathcal{S}(G) of the power graph P(G)\mathcal{P}(G) is the simple undirected graph with vertex set GG in which two vertices xx and yy are adjacent if o(x)o(y)o(x)\vert o(y) or o(y)o(x)o(y)\vert o(x). In this paper, we classify all the finite groups GG such that the order supergraph S(G)\mathcal{S}(G) is the line graph of some graph. Moreover, we characterize finite groups whose order supergraphs are the complement of line graphs.

Keywords

Cite

@article{arxiv.2310.04161,
  title  = {Line graph characterization of the order supergraph of a finite group},
  author = {Manisha and Parveen and Jitender Kumar},
  journal= {arXiv preprint arXiv:2310.04161},
  year   = {2023}
}

Comments

5 figures