Universal adjacency spectrum of (proper) power graphs and their complements on some groups
Komal Kumari, Pratima Panigrahi

TL;DR
This paper investigates the universal adjacency spectra of power graphs and their complements on specific groups, providing new spectral results and unifying various graph matrices in a group-theoretic context.
Contribution
It introduces the spectral analysis of universal adjacency matrices for power graphs and their complements on certain groups, extending known results and unifying different graph matrices.
Findings
Spectral results for power graphs on groups like 7e_n, D_n, Q_n.
Full spectrum determination in specific cases.
New insights into the spectra of graph complements on groups.
Abstract
The power graph of a group is an undirected graph with all the elements of as vertices and where any two vertices and are adjacent if and only if or , . For a simple graph with adjacency matrix and degree diagonal matrix , the universal adjacency matrix is , where , is the identity matrix and is the all-ones matrix of suitable order. One can study many graph-associated matrices, such as adjacency, Laplacian, signless Laplacian, Seidel etc. in a unified manner through the universal adjacency matrix of a graph. Here we study universal adjacency eigenvalues and eigenvectors of power graphs, proper power graphs and their complements on the group , dihedral group , and the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph theory and applications · Matrix Theory and Algorithms · Finite Group Theory Research
