A Lower Bound for the Distance Signless Laplacian Spectral Radius of Graphs in Terms of Chromatic Number  

作　　者：Xiaoxin LI Yizheng FAN Shuping ZHA 

机构地区：[1]Department of Mathematics and Computer Sciences, Chizhou University [2]School of Mathematical Sciences, Anhui University [3]School of Mathematics and Computation Sciences, Anqing Normal University

出　　处：《Journal of Mathematical Research with Applications》2014年第3期289-294,共6页数学研究及应用（英文版）

基　　金：Supported by National Natural Science Foundation of China(Grant Nos.11071002;11371028);Program for New Century Excellent Talents in University(Grant No.NCET-10-0001);Key Project of Chinese Ministry of Education(Grant No.210091);Specialized Research Fund for the Doctoral Program of Higher Education(Grant No.20103401110002);Natural Science Research Foundation of Department of Education of Anhui Province(Grant No.KJ2013A196);Scientific Research Fund for Fostering Distinguished Young Scholars of Anhui University(Grant No.KJJQ1001)

摘　　要：Let G be a connected graph on n vertices with chromatic number k, and let ρ（G） be the distance signless Laplacian spectral radius of G. We show that ρ（G） ≥ 2n ＋ 2[n/k] - 4, with equality if and only if G is a regular Turan graph.Let G be a connected graph on n vertices with chromatic number k, and let ρ（G） be the distance signless Laplacian spectral radius of G. We show that ρ（G） ≥ 2n ＋ 2[n/k] - 4, with equality if and only if G is a regular Turan graph.

关 键 词：distance matrix distance signless Laplacian spectral radius chromatic number. 

分 类 号：O157.5[理学—数学]