Regular graphs with girth at least 5 and small second largest eigenvalue

DOI10.1016/j.laa.2013.04.006zbMath1282.05124OpenAlexW1999854368MaRDI QIDQ2637112

Tamara Koledin

Publication date: 19 February 2014

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

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

zbMATH Keywords

regular graphsbipartite graphssecond largest eigenvaluegraph spectrumpartially balanced incomplete block designgraph girth

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (1)

Regular graphs with girth at least 5 and small second largest eigenvalue

Uses Software

• GENREG

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Characterizing distance-regularity of graphs by the spectrum
• Spectral characterizations of some distance-regular graphs
• Combinatorial designs with two singular values. II: Partial geometric designs
• Interlacing eigenvalues and graphs
• Regular bipartite graphs with three distinct non-negative eigenvalues
• Strongly regular graphs, partial geometries and partially balanced designs
• Regular graphs with girth at least 5 and small second largest eigenvalue
• THE SECOND LARGEST ELGENVALUES OF REGULAR BIPARTITE GRAPHS
• A Series of Symmetrical Group Divisible Incomplete Block Designs
• On regular graphs and coronas whose second largest eigenvalue does not exceed 1
• Fast generation of regular graphs and construction of cages
• Combinatorial Properties of Group Divisible Incomplete Block Designs
• Classification and Analysis of Partially Balanced Incomplete Block Designs with Two Associate Classes
• On the Construction of Group Divisible Incomplete Block Designs

This page was built for publication: Regular graphs with girth at least 5 and small second largest eigenvalue