Some further bounds for the Q-index of nested split graphs
- 40 Downloads
The Q-index of a simple graph is the largest eigenvalue of its signless Laplacian, or Q-matrix. In our previous paper  we gave three lower and three upper bounds for the Q-index of nested split graphs, also known as threshold graphs. In this paper, we give another two upper bounds, which are expressed as solutions of cubic equations (in contrast to quadratics from ). Some computational results are also included.
KeywordsSpectral Theory Large Eigenvalue Simple Graph Eigenvalue Equation Computational Data
Unable to display preview. Download preview PDF.
- 1.M. Anđelić, C. M. da Fonseca, S. K. Simić, and D. V. Tošić, “Connected graphs of fixed order and size with maximal Q-index: Some spectral bounds,” (to be published).Google Scholar