Please use this identifier to cite or link to this item:
https://research.matf.bg.ac.rs/handle/123456789/767| Title: | Some graphs whose second largest eigenvalue does not exceed √2 | Authors: | Stanić, Zoran | Affiliations: | Numerical Mathematics and Optimization | Keywords: | (Semi)regular bipartite graphs;Adjacency matrix;Second largest eigenvalue;Trees | Issue Date: | 1-Oct-2012 | Journal: | Linear Algebra and Its Applications | Abstract: | We determine all trees whose second largest eigenvalue does not exceed √2. Next, we consider two classes of bipartite graphs, regular and semiregular, with small number of distinct eigenvalues. For all graphs considered we determine those whose second largest eigenvalue is equal to √2. Some additional results are also given. © 2012 Elsevier Ltd. All rights reserved. |
URI: | https://research.matf.bg.ac.rs/handle/123456789/767 | ISSN: | 00243795 | DOI: | 10.1016/j.laa.2012.04.044 |
| Appears in Collections: | Research outputs |
Show full item record
SCOPUSTM
Citations
6
checked on Nov 8, 2024
Page view(s)
13
checked on Nov 15, 2024
Google ScholarTM
Check
Altmetric
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.