We study limit points of the spectral radii of Laplacian matrices of graphs. We adapted the method used by J. B. Shearer in 1989, devised to prove the density of adjacency limit points of caterpillars, to Laplacian limit points. We show that this fails, in the sense that there is an interval for which the method produces no limit points. Then we generalize the method to Laplacian limit points of linear trees and prove that it generates a larger set of limit points. The results of this manuscript may provide important tools for proving the density of Laplacian limit points in [4.38+,∞).
Limit points of (signless) Laplacian spectral radii of linear trees / Belardo, F.; Oliveira, E. R.; Trevisan, V.. - In: APPLIED MATHEMATICS AND COMPUTATION. - ISSN 0096-3003. - 477:(2024), pp. 1-27. [10.1016/j.amc.2024.128819]
Limit points of (signless) Laplacian spectral radii of linear trees
Belardo F.;Trevisan V.
2024
Abstract
We study limit points of the spectral radii of Laplacian matrices of graphs. We adapted the method used by J. B. Shearer in 1989, devised to prove the density of adjacency limit points of caterpillars, to Laplacian limit points. We show that this fails, in the sense that there is an interval for which the method produces no limit points. Then we generalize the method to Laplacian limit points of linear trees and prove that it generates a larger set of limit points. The results of this manuscript may provide important tools for proving the density of Laplacian limit points in [4.38+,∞).File | Dimensione | Formato | |
---|---|---|---|
Limit points of (signless) Laplacian spectral radii of linear trees.pdf
solo utenti autorizzati
Tipologia:
Versione Editoriale (PDF)
Licenza:
Accesso privato/ristretto
Dimensione
1.51 MB
Formato
Adobe PDF
|
1.51 MB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.