Spectrum of conjugacy and order super commuting graphs of some finite groups
Abstract
Let be a simple finite graph with vertex set V() and edge set E(). Let R be an equivalence relation on V(). The R-super graph R is a simple graph with vertex set V() and two distinct vertices are adjacent if either they are in the same R-equivalence class or there are elements in their respective R-equivalence classes that are adjacent in the original graph . We first show that R is a generalized join of some complete graphs and using this we obtain the adjacency and Laplacian spectrum of conjugacy and order super commuting graphs of dihedral group D2n\; (n≥ 3), generalized quaternion group Q4m \;(m≥ 2) and the nonabelian group Zp Zq of order pq, where p and q are distinct primes with q|p-1.
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.