On the Spectral Analysis of the Superpower Graph of the Direct Product of Dihedral Groups
Abstract
The superpower graph of a finite group G, or SG, is an undirected simple graph whose vertices are the elements of the group G, and two distinct vertices a,b∈ G are adjacent if and only if the order of one vertex divides the order of the other vertex, which means that either o(a)|o(b) or o(b)|o(a). In this paper, we have investigated the Aα-adjacency spectral properties of the superpower graph of the direct product Dp× Dp, where Dp is a dihedral group for p being prime. Also, we have determined its Laplacian and signless Laplacian spectrum by giving different values to α; furthermore, we delved into its superpower graph and deduced the Aα- adjacency spectrum of the superpower graph of Dp× Dp and Dpm for p being an odd prime.
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.