| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4599821 | Linear Algebra and its Applications | 2014 | 11 Pages |
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.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Algebra and Number Theory
Authors
Tamara Koledin, Zoran Stanić,