Abstract
A graph is said to have a small spectral radius if it does not exceed the corresponding Hoffmann limit value. In the case of (signless) Laplacian matrix, the Hoffmann limit value is equal to ϵ+2=4.38+, with ϵ being the real root of x3-4x-4. Here the spectral characterization of connected graphs with small (signless) Laplacian spectral radius is considered. It is shown that all connected graphs with small Laplacian spectral radius are determined by their Laplacian spectra, and all but one of connected graphs with small signless Laplacian spectral radius are determined by their signless Laplacian spectra.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
