首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Graphs with at most one signless Laplacian eigenvalue exceeding three
Authors:Hongying Lin
Institution:Department of Mathematics, South China Normal University, Guangzhou, P.R. China.
Abstract:We determine all connected graphs with at most one signless Laplacian eigenvalue exceeding three.
Keywords:signless Laplacian matrix  signless Laplacian spectrum  signless Laplacian eigenvalues  forbidden subgraph  non-bipartite graph
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号