On some characterizations of strong power graphs of finite groups
Abstract
Let G be a finite group of order n. The strong power graph Ps(G) of G is the undirected graph whose vertices are the elements of G such that two distinct vertices a and b are adjacent if am1=bm2 for some positive integers m1 ,m2 < n. In this article we classify all groups G for which Ps(G) is line graph and Caley graph. Spectrum and permanent of the Laplacian matrix of the strong power graph Ps(G) are found for any finite group G.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.