Notes on the second largest eigenvalue of a graph

Časopis: LINEAR ALGEBRA AND ITS APPLICATIONS

Volume 465

ISSN: 0024-3795

Stranice: 262-274

Link: https://www.sciencedirect.com/science/article/pii/S002437951400617X

Apstrakt:
For a fixed real number r we give several necessary and/or sufficient conditions for a graph to have the second largest eigenvalue of the adjacency matrix, or signless Laplacian matrix, less then or equal to r.
Ključne reči: Graph, Adjacency matrix, Signless Laplacian, Second largest eigenvalue