arXiv:2407.19771 [math.CO]AbstractReferencesReviewsResources
Characteristic Polynomial of Power Graphs on Direct Product of Any Two Finite Cyclic Groups
Komal Kumari, Pratima Panigrahi
Published 2024-07-29Version 1
The power graph $\mathscr{P}(G)$ of a group $G$ is defined as the simple graph with vertex set $G$, and where two distinct vertices $x$ and $y$ are joined by an edge if and only if either $x= y^k$ or $y= x^k$, $k \in \mathbb{N}$. Here we determine the characteristic polynomial of $\mathscr{P}(\mathbb{Z}_m \times \mathbb{Z}_{n})$ for any positive integers $m$ and $n$. Additionally, for some particular values of $m$ and $n$, we simplify the above characteristic polynomials and provide the full spectrum in a few cases.
Categories: math.CO
Related articles: Most relevant | Search more
arXiv:1306.4649 [math.CO] (Published 2013-06-19)
On the characteristic polynomial of Laplacian Matrices of Caterpillars
arXiv:2310.07104 [math.CO] (Published 2023-10-11)
On the edge reconstruction of the characteristic and permanental polynomials of a simple graph
arXiv:1711.03868 [math.CO] (Published 2017-11-09)
On the $A_α$-characteristic polynomial of a graph