5 papers · 1 filter
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…
Asymptotic maximum spectral radius of nonregular graphs
Hangxi Cha, Haiying Shan
Let be the maximum adjacency spectral radius among connected nonregular simple graphs of order and maximum degree . Using effective resistance bounds, explicit co…
Uniform Hypergraphs with -Spectral Radius at Most That of a Loose Cycle
Hangxi Cha, Xiaoqi Liu, Haiying Shan
Let and , and let denote the -spectral radius of a -uniform loose cycle. Lu and Man classified all connected -uniform hypergraphs with adjace…
Graphs with zero as a main eigenvalue of the signless Laplacian
Hangxi Cha, Haiying Shan
An eigenvalue of the signless Laplacian is -main if its eigenspace is not orthogonal to the all-ones vector. We characterize graphs with exactly -main eigen…
Trees with exactly three main eigenvalues
Hangxi Cha, Haiying Shan
An eigenvalue of a graph is called main if its eigenspace is not orthogonal to the all-ones vector. Introduced by Cvetković in the early 1970s and systematically studied by Rowlins…