Please use this identifier to cite or link to this item:
https://research.matf.bg.ac.rs/handle/123456789/728
Title: | On graphs whose second largest eigenvalue is at most 1 | Authors: | Liu, Muhuo Chen, Chaohui Stanić, Zoran |
Affiliations: | Numerical Mathematics and Optimization | Issue Date: | 2021 | Rank: | M22 | Journal: | European Journal of Combinatorics | Abstract: | We determine all connected {K1,3,K5−e}-free graphs whose second largest eigenvalue does not exceed 1. Our result includes all connected line graphs with the same spectral property, and therefore strengthens the result of Petrović and Milekić (1998). |
URI: | https://research.matf.bg.ac.rs/handle/123456789/728 | ISSN: | 01956698 | DOI: | 10.1016/j.ejc.2021.103385 |
Appears in Collections: | Research outputs |
Show full item record
SCOPUSTM
Citations
7
checked on Nov 8, 2024
Page view(s)
16
checked on Nov 15, 2024
Google ScholarTM
Check
Altmetric
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.