给定染色数的无符号Laplace谱半径(英文)  

The Signless Laplacian Spectral Radius of Graphs with Given Chromatic Number

作　　者：蔡改香[1,2] 范益政[1] 

机构地区：[1]安徽大学数学科学学院,安徽合肥230039 [2]安庆师范学院数学与计算科学学院,安徽安庆246011

出　　处：《应用数学》2009年第1期161-167,共7页Mathematica Applicata

基　　金：Supported by National Natural Science Foundation of China(10601001);Anhui Provincial Natural Science Foundation(050460102 ,070412065);NSF of Depart ment of Education of Anhui Province (2005kj005zd);Foundation of Innovation Teamon Basic Mathematics of Anhui University;Foundation of Talents Group Construction of Anhui University .

摘　　要：设Gkn(k≥2)为n阶的染色数为k的连通图的集合.本文确定了Gnk中具有极大无符号Laplace谱半径的图,即k =2时为完全二部图,k≥3时为Turán图.本文也讨论了Gnk中的具有极小无符号Laplace谱半径的图,对k≤3的情形给出了此类图的刻画.Let （k ≥ 2） be the set of all connected graphs of order n with chromatic number k. We determine the graphs with maximal signless Laplacian spectral radius among all graphs in , namely complete bipartite graphs for k = 2 and Turin graph for k ≥ 3. We also consider the graphs with minimal signless Laplacian spectral radius in , and characterized such graphs for k ≤3.

关 键 词：图 染色数 无符号Laplace谱半径 

分 类 号：O157.5[理学—数学] O151.21[理学—基础数学]