Regular bipartite graphs with three distinct non-negative eigenvalues

DOI10.1016/j.laa.2012.12.036zbMath1261.05056OpenAlexW2031317693MaRDI QIDQ1947095

Tamara Koledin, Zoran Stanić

Publication date: 12 April 2013

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2012.12.036

zbMATH Keywords

eigenvaluesadjacency matrixregular graphsbipartite graphsblock designs

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items

Distance spectrum and energy of graphs with small diameter ⋮ Regular graphs with girth at least 5 and small second largest eigenvalue ⋮ Spectra of strongly Deza graphs ⋮ Periodicity of Grover walks on bipartite regular graphs with at most five distinct eigenvalues

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Two spectral characterizations of regular, bipartite graphs with five eigenvalues
• Feasibility conditions for the existence of walk-regular graphs
• Note on Hadamard tournaments of Szekeres type
• Combinatorial designs with two singular values. II: Partial geometric designs
• Regular graphs with four eigenvalues
• Strongly regular graphs, partial geometries and partially balanced designs
• A Series of Symmetrical Group Divisible Incomplete Block Designs
• Some spectral inequalities for triangle-free regular graphs

This page was built for publication: Regular bipartite graphs with three distinct non-negative eigenvalues