文献类型：期刊文献

英文题名：The smallest signless Laplacian spectral radius of graphs with a given clique number

作者：Zhang, Jing-Ming[1,2];Huang, Ting-Zhu[1];Guo, Ji-Ming[3]

机构：[1]Univ Elect Sci & Technol China, Sch Math Sci, Chengdu 611731, Sichuan, Peoples R China;[2]China Univ Petr, Coll Sci, Qingdao 266580, Shandong, Peoples R China;[3]E China Univ Sci & Technol, Coll Sci, Shanghai 200237, Peoples R China

年份：2013

卷号：439

期号：9

起止页码：2562

外文期刊名：LINEAR ALGEBRA AND ITS APPLICATIONS

收录：;EI(收录号：20134717006746);WOS:【SCI-EXPANDED(收录号:WOS:000324966800004)】；

基金：This research is supported by NSFC (Nos. 11371372, 61170311), Sichuan Province Sci. & Tech. Research Project (No. 12ZC1802).

语种：英文

外文关键词：Signless Laplacian spectral radius; Clique number; Signless Laplacian characteristic polynomial

摘要：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. (C) 2013 Elsevier Inc. All rights reserved.