On the (non-)existence of tight distance-regular graphs: a local approach

DOI10.37236/12699MaRDI QIDQ6499981

Xiaoye Liang, Shuang-Dong Li, Ying-Ying Tan, Unnamed Author, Jack H. Koolen, Jae-Ho Lee

Publication date: 10 May 2024

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

zbMATH Keywords

Steiner systemblock graph

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Distance in graphs (05C12) Graph designs and isomorphic decomposition (05C51)

Cites Work

• Unnamed Item
• Unnamed Item
• Distance-regular graphs
• There are only finitely many distance-regular graphs of fixed valency greater than two
• Distance-regular graphs with or at least half the valency
• On graphs with complete multipartite \(\mu \)-graphs
• Strongly regular graphs with smallest eigenvalue -m
• Krein parameters and antipodal tight graphs with diameter 3 and 4
• Tight distance-regular graphs
• Restrictions on classical distance-regular graphs
• Tight distance-regular graphs and the subconstituent algebra
• Erdős–Ko–Rado Theorems: Algebraic Approaches
• Strongly Regular Graphs
• An inequality on the cosines of a tight distance-regular graph
• Tight distance-regular graphs and the \(Q\)-polynomial property

This page was built for publication: On the (non-)existence of tight distance-regular graphs: a local approach