Non-bipartite distance-regular graphs with a small smallest eigenvalue

zbMath1416.05096arXiv1901.01157MaRDI QIDQ2001973

Jack H. Koolen, Yifan Jing, Zhi Qiao

Publication date: 11 July 2019

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1901.01157

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Structural characterization of families of graphs (05C75) Distance in graphs (05C12)

Related Items (3)

A spectral bound for vertex-transitive graphs and their spanning subgraphs ⋮ Fractional decompositions and the smallest-eigenvalue separation ⋮ Non-bipartite distance-regular graphs with diameters 5, 6 and a smallest eigenvalue

Cites Work

• Unnamed Item
• Distance-regular graphs
• There are only finitely many distance-regular graphs of fixed valency greater than two
• Some results on the eigenvalues of distance-regular graphs
• The distance-regular graphs of valency four
• A valency bound for distance-regular graphs
• Cubic Distance-Regular Graphs

This page was built for publication: Non-bipartite distance-regular graphs with a small smallest eigenvalue