New families of graphs determined by their generalized spectrum

2018/03/29 by Liu, Fenjin, Siemons, Johannes, Wang, Wei
#05C50 #15A18 #Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.1803.11275

Abstract

We construct infinite families of graphs that are determined by their generalized spectrum. This construction is based on new formulae for the determinant of the walk matrix of a graph. The graphs constructed here all satisfy a lower divisibility for the determinant of their walk matrix.

Related

• A simple arithmetic criterion for graphs being determined by their generalized spectra
• Walk Matrix-Based Upper Bounds on Generalized Cospectral Mates
• Construction of graphs being determined by their generalized Q-spectra
• A sufficient condition for generalized spectral characterization of graphs with loops
• A new approach for constructing graph being determined by their generalized Q-spectrum