Graphs determined by their $A_{\alpha}$-spectra
Huiqiu Lin, Xiaogang Liu, Jie Xue

TL;DR
This paper investigates which graphs are uniquely identified by their $A_{\alpha}$-spectra, introducing new results for various graph classes and conditions, and explores the spectral determination of graph joins for $\alpha$ in (1/2, 1).
Contribution
It proves that several classes of graphs are determined by their $A_{\alpha}$-spectra for $0 \leq \alpha < 1$, and establishes conditions linking spectral determination of graphs and their joins.
Findings
Complete graphs, stars, paths, and certain cycle unions are determined by their $A_{\alpha}$-spectra.
For regular graphs, spectral determination of $G$ is equivalent to that of $G \vee K_m$ for $\frac{1}{2}<\alpha<1$.
The join $K_m \vee P_n$ is determined by its $A_{\alpha}$-spectrum for $\frac{1}{2}<\alpha<1$.
Abstract
Let be a graph with vertices, and let and denote respectively the adjacency matrix and the degree matrix of . Define for any real . The collection of eigenvalues of together with multiplicities are called the \emph{-spectrum} of . A graph is said to be \emph{determined by its -spectrum} if all graphs having the same -spectrum as are isomorphic to . We first prove that some graphs are determined by its -spectrum for , including the complete graph , the star , the path , the union of cycles and the complement of the union of cycles, the union of and and the complement of the union of and , and the complement of . Setting or , those graphs…
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 · Phase-change materials and chalcogenides
