On Spectral Graph Determination

Abstract

The study of spectral graph determination is a fascinating area of research in spectral graph theory and algebraic combinatorics. This field focuses on examining the spectral characterization of various classes of graphs, developing methods to construct or distinguish cospectral nonisomorphic graphs, and analyzing the conditions under which a graph's spectrum uniquely determines its structure. This paper presents an overview of both classical and recent advancements in these topics, along with newly obtained proofs of some existing results, which offer additional insights.

Published in Mathematics, vol. 13, no. 4, paper 549, pp. 1--44, February 2025. Please also follow this link https://www.mdpi.com/2227-7390/13/4/549

References in corpus (6)

• Graphs whose normalized Laplacian has three eigenvalues
• Observations on the Lovász $\theta$-Function, Graph Capacity, Eigenvalues, and Strong Products
• Observations on Graph Invariants with the Lovász $\vartheta$-Function
• Haemers' conjecture: an algorithmic perspective
• On the construction of cospectral nonisomorphic bipartite graphs
• On Spectrum of Neighbourhood Corona Product of Signed Graphs