运筹学学报 >
2015 , Vol. 19 >Issue 2: 99 - 104
DOI: https://doi.org/10.15960/j.cnki.issn.1007-6093.2015.02.011
单圈图和双圈图的最大无符号拉普拉斯分离度
The maximum signless Laplacian separator of unicyclic and bicyclic graphs
Received date: 2014-10-02
Online published: 2015-06-15
设G是一个n阶简单图，q_{1}(G)\geq q_{2}(G)\geq \cdots \geq q_{n}(G)是其无符号拉普拉斯特征值. 图G的无符号拉普拉斯分离度定义为S_{Q}(G)=q_{1}(G)-q_{2}(G). 确定了n阶单圈图和双圈图的最大的无符号拉普拉斯分离度，并分别刻画了相应的极图.
关键词： 单圈图; 双圈图; 无符号拉普拉斯分离度; 无符号拉普拉斯矩阵
简相国,袁西英,张曼 . 单圈图和双圈图的最大无符号拉普拉斯分离度[J]. 运筹学学报, 2015 , 19(2) : 99 -104 . DOI: 10.15960/j.cnki.issn.1007-6093.2015.02.011
Let G be a graph of order n and q_{1}(G)\geq q_{2}(G)\geq \cdots \geq q_{n}(G) be its Q-eigenvalues. The signless Laplacian separator S_{Q}(G) of G is defined as S_{Q}(G)=q_{1}(G)-q_{2}(G). In this paper, we study the maximum signless Laplacian separator of unicyclic and bicyclic graphs and characterize the extremal graphs, respectively.
/
| 〈 |
|
〉 |
