An arithmetic criterion for graphs being determined by their generalized $A_\alpha$-spectrum
Shuchao Li, Wanting Sun

TL;DR
This paper provides an arithmetic criterion involving the $A_eta$-spectrum to determine when a graph is uniquely identified by its spectrum and its complement, extending spectral graph theory with new algebraic conditions.
Contribution
It introduces a simple arithmetic condition for graphs to be determined by their generalized $A_eta$-spectrum when $eta$ is rational, expanding spectral characterization methods.
Findings
A new criterion based on the determinant of a specific matrix for DGA$_eta$S.
The criterion involves the parity and square-free nature of a scaled determinant.
Full rank conditions over finite fields are also part of the criterion.
Abstract
Let be a graph on vertices, its adjacency matrix and degree diagonal matrix are denoted by and , respectively. In 2017, Nikiforov \cite{0007} introduced the matrix for The -spectrum of a graph consists of all the eigenvalues (including the multiplicities) of A graph is said to be determined by the generalized -spectrum (or, DGAS for short) if whenever is a graph such that and share the same -spectrum and so do their complements, then is isomorphic to . In this paper, when is rational, we present a simple arithmetic condition for a graph being DGAS. More precisely, put here is the smallest positive integer such that is an integral matrix.…
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 · graph theory and CDMA systems
