Graphs with the second signless Laplacian eigenvalue ≤ 4
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...
Main Author: | Drury Stephen |
---|---|
Format: | Article |
Language: | English |
Published: |
De Gruyter
2021-12-01
|
Series: | Special Matrices |
Subjects: | |
Online Access: | https://doi.org/10.1515/spma-2021-0152 |
Similar Items
-
On a conjecture involving the second largest signless Laplacian eigenvalue and the index of graphs
by: Enkhbayar Azjargal, et al.
Published: (2020-06-01) -
The second least eigenvalue of the signless Laplacian of the complements of trees
by: Muhammad Ajmal, et al.
Published: (2019-10-01) -
Seidel Signless Laplacian Energy of Graphs
by: Harishchandra Ramane, et al.
Published: (2017-12-01) -
Color signless Laplacian energy of graphs
by: Pradeep G. Bhat, et al.
Published: (2017-08-01) -
Remoteness and distance, distance (signless) Laplacian eigenvalues of a graph
by: Huicai Jia, et al.
Published: (2018-04-01)