微信 
Facebook 
分享链接 
Graphs with at most one signless Laplacian eigenvalue exceeding three
SCI
华南师范大学; bpotest
摘要
We determine all connected graphs with at most one signless Laplacian eigenvalue exceeding three.
关键词
05C50 forbidden subgraph signless Laplacian eigenvalues non-bipartite graph signless Laplacian spectrum signless Laplacian matrix