3 papers
math.CO2025
Almost all graphs have no cospectral mate with fixed level
Wei Wang, Da Zhao
Haemers conjectures that almost all graphs are determined by their spectra. Suppose is a random graph with each edge chosen independently with probabilit…
math.CO2024
Upper bounds of Steklov eigenvalues on graphs
Huiqiu Lin, Lianping Liu, Zhe You +1
Let and be the maximum vertex degree and a subset of vertices in a graph respectively. In this paper, we study the first (non-trivial) Steklov eigenvalue of w…
math.CO2024
Bivariate -polynomial structures for the nonbinary Johnson scheme and the association scheme obtained from attenuated spaces
Eiichi Bannai, Hirotake Kurihara, Da Zhao +1
The study of -polynomial association schemes (distance-regular graphs) and -polynomial association schemes, and in particular - and -polynomial association schemes, has…