2 papers
math.CO2026
A Cameron-Goethals-Seidel-Shult theorem for marked graphs
Chaohui Chen, Muhuo Liu, Haiying Shan +1
The classical Cameron-Goethals-Seidel-Shult theorem characterizes graphs with least eigenvalue at least in terms of generalized line graphs, exceptional graphs, and root syste…
math.CO2026
A complete characterization of graphs with second largest eigenvalue at most
Chaohui Chen, Hangxi Cha, Haiying Shan +1
In 1993, Cao and Hong posed the problem of characterizing graphs whose second largest adjacency eigenvalue is greater than and less than . Subsequent work exten…