IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v477y2024ics0096300324002807.html
   My bibliography  Save this article

Limit points of (signless) Laplacian spectral radii of linear trees

Author

Listed:
  • Belardo, Francesco
  • Oliveira, Elismar R.
  • Trevisan, Vilmar

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+,∞).

Suggested Citation

  • Belardo, Francesco & Oliveira, Elismar R. & Trevisan, Vilmar, 2024. "Limit points of (signless) Laplacian spectral radii of linear trees," Applied Mathematics and Computation, Elsevier, vol. 477(C).
    • Handle: RePEc:eee:apmaco:v:477:y:2024:i:c:s0096300324002807
    DOI: 10.1016/j.amc.2024.128819
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300324002807
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2024.128819?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:apmaco:v:477:y:2024:i:c:s0096300324002807. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.