English

On some characterizations of strong power graphs of finite groups

Combinatorics 2015-07-20 v2

Abstract

Let G G be a finite group of order n n. The strong power graph Ps(G)\mathcal{P}_s(G) of GG is the undirected graph whose vertices are the elements of GG such that two distinct vertices aa and bb are adjacent if am1a^{{m}_1}=bm2b^{{m}_2} for some positive integers m1,m2<n{m}_1 ,{m}_2 < n. In this article we classify all groups GG for which Ps(G)\mathcal{P}_s(G) is line graph and Caley graph. Spectrum and permanent of the Laplacian matrix of the strong power graph Ps(G)\mathcal{P}_s(G) are found for any finite group GG.

Keywords

Cite

@article{arxiv.1504.06095,
  title  = {On some characterizations of strong power graphs of finite groups},
  author = {A. K. Bhuniya and S. Bera},
  journal= {arXiv preprint arXiv:1504.06095},
  year   = {2015}
}

Comments

13 pages