A note on the second largest eigenvalue of the laplacian matrix of a graph∗

2000 ◽  
Vol 48 (2) ◽  
pp. 117-121 ◽  
Author(s):  
Jiong-Sheng Li ◽  
Yong-Liang Pan
2021 ◽  
Vol 10 (1) ◽  
pp. 131-152
Author(s):  
Stephen Drury

Abstract We discuss the question of classifying the connected simple graphs H for which the second largest eigenvalue of the signless Laplacian Q(H) is ≤ 4. We discover that the question is inextricable linked to a knapsack problem with infinitely many allowed weights. We take the first few steps towards the general solution. We prove that this class of graphs is minor closed.


10.37236/169 ◽  
2009 ◽  
Vol 16 (1) ◽  
Author(s):  
Yanqing Chen ◽  
Ligong Wang

The Laplacian spread of a graph is defined to be the difference between the largest eigenvalue and the second smallest eigenvalue of the Laplacian matrix of the graph. In this paper, we investigate Laplacian spread of graphs, and prove that there exist exactly five types of tricyclic graphs with maximum Laplacian spread among all tricyclic graphs of fixed order.


2016 ◽  
pp. n/a-n/a
Author(s):  
Weijia Xue ◽  
Tingting Lin ◽  
Xin Shun ◽  
Fenglei Xue ◽  
Xuejia Lai

1995 ◽  
Vol 138 (1-3) ◽  
pp. 213-227 ◽  
Author(s):  
Dragoš Cvetković ◽  
Slobodan Simić

Author(s):  
Drasko Tomic ◽  
Karolj Skala ◽  
Lado Kranjcevic ◽  
Boris Pirkic ◽  
Sanja Stifter ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document