Please use this identifier to cite or link to this item:
https://research.matf.bg.ac.rs/handle/123456789/776| Title: | Reflexive bipartite regular graphs | Authors: | Koledin, Tamara Stanić, Zoran |
Affiliations: | Numerical Mathematics and Optimization | Keywords: | Adjacency matrix;Bipartite regular graphs;Block designs;Bounded eigenvalues | Issue Date: | 1-Feb-2014 | Journal: | Linear Algebra and Its Applications | Abstract: | A graph is called reflexive if its second largest eigenvalue does not exceed 2. In this paper, we determine all reflexive bipartite regular graphs. Any bipartite regular graph of degree at most 2 is reflexive as well as its bipartite complement. Apart from them, there is a finite number of resulting graphs. © 2013 Elsevier Inc. All rights reserved. |
URI: | https://research.matf.bg.ac.rs/handle/123456789/776 | ISSN: | 00243795 | DOI: | 10.1016/j.laa.2013.07.020 |
| Appears in Collections: | Research outputs |
Show full item record
SCOPUSTM
Citations
9
checked on Nov 8, 2024
Page view(s)
12
checked on Nov 15, 2024
Google ScholarTM
Check
Altmetric
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.