Back to Search Start Over

Reflexive bipartite regular graphs.

Authors :
Koledin, Tamara
Stanić, Zoran
Source :
Linear Algebra & its Applications. Feb2014, Vol. 442, p145-155. 11p.
Publication Year :
2014

Abstract

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. [Copyright &y& Elsevier]

Subjects

Subjects :
*BIPARTITE graphs
*GRAPH theory
*REGULAR graphs
*EIGENVALUES
*MODULES (Algebra)

Details

Language :
English
ISSN :
00243795
Volume :
442
Database :
Academic Search Index
Journal :
Linear Algebra & its Applications
Publication Type :
Academic Journal
Accession number :
92733392
Full Text :
https://doi.org/10.1016/j.laa.2013.07.020
Full Text Access
View/download PDF

Tools

Authors Abstract Subjects Details