Please use this identifier to cite or link to this item: https://research.matf.bg.ac.rs/handle/123456789/750
Title: Regular bipartite graphs with three distinct non-negative eigenvalues
Authors: Koledin, Tamara
Stanić, Zoran 
Affiliations: Numerical Mathematics and Optimization 
Keywords: Adjacency matrix;Bipartite graphs;Block designs;Eigenvalues;Regular graphs
Issue Date: 31-Jan-2013
Rank: M22
Publisher: Elsevier
Journal: Linear Algebra and Its Applications
Abstract: 
We derive some structural and spectral properties of regular bipartite graphs with three distinct non-negative eigenvalues. Next, we consider the relations between these graphs and two-class partially balanced incomplete block designs, and we present a number of situations when the graphs we consider are in fact the incidence graphs of those designs. As a consequence, we give a several constructions of connected regular bipartite graphs with six distinct eigenvalues, and we also determine all such graphs with degree 3, and all such graphs on at most 20 vertices.© 2012 Elsevier Inc. All rights reserved.
URI: https://research.matf.bg.ac.rs/handle/123456789/750
ISSN: 00243795
DOI: 10.1016/j.laa.2012.12.036
Appears in Collections:Research outputs

Show full item record

SCOPUSTM   
Citations

6
checked on Mar 28, 2025

Page view(s)

11
checked on Jan 19, 2025

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.