2000 character limit reached
Characteristic Polynomial of Power Graphs on Direct Product of Any Two Finite Cyclic Groups
Published 29 Jul 2024 in math.CO | (2407.19771v1)
Abstract: 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= yk$ or $y= xk$, $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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.