New arithmetic invariants for cospectral graphs

TL;DR

This paper introduces three new arithmetic invariants for cospectral graphs, linking spectral properties with combinatorial structures, and demonstrates their applications in graph determination, matchings, triangles, and polynomial reconstruction.

Contribution

The paper establishes three novel arithmetic invariants for cospectral graphs, revealing new spectral-combinatorial connections and solving related conjectures.

Findings

Proves a congruence relation for all powers of adjacency matrices of cospectral graphs.

Shows cospectral graphs can be distinguished by generalized spectrum under certain conditions.

Connects spectral invariants to polynomial reconstruction and graph properties like matchings and triangles.

Abstract

An invariant for cospectral graphs is a property shared by all cospectral graphs. In this paper, we establish three novel arithmetic invariants for cospectral graphs, revealing deep connections between spectral properties and combinatorial structures. More precisely, one of our main results shows that for any two cospectral graphs $G$ and $H$ with adjacency matrices $A(G)$ and $A(H)$, respectively, the following congruence holds for all integers $m\geq 0$:\[e^{\rm T}A(G)^me\equiv e^{\rm T}A(H)^me \pmod{4},\] where $e$ is the all-one vector. Moreover, we present a number of fascinating applications. Specifically: i) Resolving a conjecture proposed by the third author, we demonstrate that under certain conditions, every graph cospectral with a graph $G$ is determined by its generalized spectrum. ii) We demonstrate that whenever the complements of two trees are cospectral, then one tree has a perfect matching if and only if the other does. An analogous result holds for the existence of triangles in general graphs. iii) An unexpected connection to the polynomial reconstruction problem is also provided, showing that the parity of the constant term of the characteristic polynomial is reconstructible.