Indexed metadata

Adjacency spectrum of power graphs of Zm×Zn\mathbb{Z}_m \times \mathbb{Z}_n

Komal Kumari, Pratima Panigrahi

Source record

Source: Crossref

Published: Sep 6, 2026

DOI: 10.13069/jacodesmath.v13i3.365

Open original source ↗

Source abstract

The power graph P(G)\mathscr{P}(G) of a group GG is defined as the simple graph with vertex set GG, and two distinct vertices xx and yy are joined by an edge if and only if either x=ykx= y^k or y=xky= x^k, kNk \in \mathbb{N}. In this paper, first, we obtain the characteristic polynomial of P(Zm×Zn)\mathscr{P}(\mathbb{Z}_m \times \mathbb{Z}_{n}) for any two positive integers mm and nn. Then, we determine the full spectrum of P(Zm×Zn)\mathscr{P}(\mathbb{Z}_m \times \mathbb{Z}_{n}) for some particular values of mm and nn. Received: 20 January 2025 | Accepted: 13 January 2026

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.