3 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.CO2025
Signless Laplacian characterization of cones over disjoint unions of cycles, edges and isolated vertices
Jiachang Ye, Jianguo Qian, Zoran Stanic
Two graphs are said to be -cospectral if they share the same signless Laplacian spectrum. A simple graph is said to be determined by its signless Laplacian spectrum (abbreviated…
math.CO2025
Determining some graph joins by the signless Laplacian spectrum
Jiachang Ye, Jianguo Qian, Zoran Stanić
A graph is determined by its signless Laplacian spectrum if there is no other non-isomorphic graph sharing the same signless Laplacian spectrum. Let , , and $K_{s,l…