| 给定染色数的无符号Laplace谱半径 |
| |
| 引用本文： | 蔡改香,范益政.给定染色数的无符号Laplace谱半径[J].应用数学,2009,22(1). |
| |
| 作者姓名： | 蔡改香 范益政 |
| |
| 作者单位： | 1. 安徽大学数学科学学院,安徽,合肥,230039;安庆师范学院数学与计算科学学院,安徽,安庆,246011
2. 安徽大学数学科学学院,安徽,合肥,230039 |
| |
| 基金项目： | 国家自然科学基金，安徽省自然科学基金，NSF of Department of Education of Anhui Province，Foundation of Innovation Team on Basic Mathematics of Anhui University，Foundation of Talents Group Construction of Anhui University |
| |
| 摘 要： | 设Gkn(k≥2)为n阶的染色数为k的连通图的集合.本文确定了Gkn中具有极大无符号Laplace谱半径的图,即k=2时为完全二部图,k≥3时为Turn图.本文也讨论了Gkn中的具有极小无符号Laplace谱半径的图,对k≤3的情形给出了此类图的刻画.
|
| 关 键 词： | 图 染色数 无符号Laplace谱半径 |
The Signless Laplacian Spectral Radius of Graphs with Given Chromatic Number |
| |
| CAI Gai-xiang,FAN Yi-Zheng.The Signless Laplacian Spectral Radius of Graphs with Given Chromatic Number[J].Mathematica Applicata,2009,22(1). |
| |
| Authors: | CAI Gai-xiang FAN Yi-Zheng |
| |
| Abstract: | Let Gkn(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 Gkn,namely complete bipartite graphs for k=2 and Turn graph for k≥3.We also consider the graphs with minimal signless Laplacian spectral radius in Gkn, and characterized such graphs for k≤3. |
| |
| Keywords: | Graph Chromatic number Signless Laplacian spectral radius |
| 本文献已被 维普 万方数据 等数据库收录！ |
|
