Characteristic Polynomial of Power Graphs on Direct Product of Any Two Finite Cyclic Groups
Abstract
The power graph 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 ∈ N. Here we determine the characteristic polynomial of P(Zm × Zn) 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.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.