|
Zapiski Nauchnykh Seminarov POMI, 2013, Volume 419, Pages 139–153
(Mi znsl5742)
|
|
|
|
This article is cited in 2 scientific papers (total in 2 papers)
Bounds for the largest two eigenvalues of the signless Laplacian
L. Yu. Kolotilina St. Petersburg Department of the Steklov Mathematical Institute, St. Petersburg, Russia
Abstract:
In the paper, a new upper bound for the largest eigenvalue $q_1$ of the signless Laplacian $Q_G=D_G+A_G$ of a graph $G$, generalizing and improving the known bound $q_1\le\Delta_1+\Delta_2$, where $\Delta_1\ge\cdots\ge\Delta_n$ are the ordered vertex degrees, and new lower bounds for the second largest eigenvalue $q_2$ of $Q_G$ are proved. As implications, an upper bound for the difference $q_1-\mu_1$ of the largest eigenvalues of the signless Laplacian $Q_G$ and of the Laplacian $L_G=D_G-A_G$, an upper bound for the largest eigenvalue of the adjacency matrix $A_G$, and an upper bound for the difference $q_1-q_2$ are obtained. All the bounds suggested are expressed in terms of the vertex degrees.
Key words and phrases:
graph, adjacency matrix, Laplacian, signless Laplacian, largest eigenvalue, second largest eigenvalue, upper bound, lower bound.
Received: 01.11.2013
Citation:
L. Yu. Kolotilina, “Bounds for the largest two eigenvalues of the signless Laplacian”, Computational methods and algorithms. Part XXVI, Zap. Nauchn. Sem. POMI, 419, POMI, St. Petersburg, 2013, 139–153; J. Math. Sci. (N. Y.), 199:4 (2014), 448–455
Linking options:
https://www.mathnet.ru/eng/znsl5742 https://www.mathnet.ru/eng/znsl/v419/p139
|
Statistics & downloads: |
Abstract page: | 233 | Full-text PDF : | 55 | References: | 49 |
|