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


The smallest signless Laplacian spectral radius of graphs with a given clique number
Authors:Jing-Ming Zhang  Ting-Zhu Huang  Ji-Ming Guo
Institution:1. School of Mathematical Sciences, University of Electronic Science and Technology of China, Chengdu, Sichuan, 611731, China;2. College of Science, China University of Petroleum, Shandong, QingDao, 266580, China;3. College of Science, East China University of Science and Technology, Shanghai, 200237, China
Abstract:The signless Laplacian spectral radius of a graph G is the largest eigenvalue of its signless Laplacian matrix. In this paper, the first four smallest values of the signless Laplacian spectral radius among all connected graphs with maximum clique of size greater than or equal to 2 are obtained.
Keywords:05C50
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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