Non-bipartite distance-regular graphs with diameters 5, 6 and a smallest eigenvalue

DOI10.1007/s00373-022-02458-2zbMath1487.05080OpenAlexW4220822412MaRDI QIDQ2117517

Yanyan Li

Publication date: 21 March 2022

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-022-02458-2

zbMATH Keywords

distance-regular graphsmallest eigenvaluevalency

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)

Cites Work

• Unnamed Item
• Distance-regular graphs
• Distance-regular graphs with an eigenvalue \(-k < \theta \leq 2-k\)
• There are only finitely many distance-regular graphs of fixed valency greater than two
• The distance-regular graphs such that all of its second largest local eigenvalues are at most one
• Spectra of graphs
• Some results on the eigenvalues of distance-regular graphs
• The distance-regular graphs of valency four
• A valency bound for distance-regular graphs
• Non-bipartite distance-regular graphs with a small smallest eigenvalue
• Fractional decompositions and the smallest-eigenvalue separation
• Distance-regular Cayley graphs with least eigenvalue \(-2\)
• An inequality involving the second largest and smallest eigenvalue of a distance-regular graph
• Strongly regular graphs with (-1, 1, 0) adjacency matrix having eigenvalue 3
• Cubic Distance-Regular Graphs

This page was built for publication: Non-bipartite distance-regular graphs with diameters 5, 6 and a smallest eigenvalue