Operations Research Transactions >
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
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.
JIAN Xiangguo,YUAN Xiying,ZHANG Man . The maximum signless Laplacian separator of unicyclic and bicyclic graphs[J]. Operations Research Transactions, 2015 , 19(2) : 99 -104 . DOI: 10.15960/j.cnki.issn.1007-6093.2015.02.011
/
| 〈 |
|
〉 |