arXiv:1504.06095 [math.CO]AbstractReferencesReviewsResources
On the Laplacian of strong power graphs of finite groups
Published 2015-04-23Version 1
Let $ G $ be a finite group of order $ n$. The strong power graph $\mathcal{P}_s(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 $a^{{m}_1}$=$b^{{m}_2}$ for some positive integers ${m}_1 ,{m}_2 < n.$ In this article we give a complete characterization of Laplacian spectrum, and find the permanent of the Laplacian matrix of the strong power graph $\mathcal{P}_s(G)$ for any finite group $G$.
Comments: 9 pages
Categories: math.CO
Related articles: Most relevant | Search more
arXiv:2310.12283 [math.CO] (Published 2023-10-17)
A characterization of 4-connected graphs with no $K_{3,3}+v$-minor
Complete characterization of the minimal-ABC trees
arXiv:2012.14380 [math.CO] (Published 2020-12-28)
A complete characterization of $(f_0, f_1)$-pairs of 6-polytopes