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...

Full description

Bibliographic Details
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