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

DOI10.37236/12699MaRDI QIDQ6499981zbMATH OpenFDO

Authors Jack H. Koolen, Jae-Ho Lee, Shuangdong Li, Xiaoye Liang, Ying-Ying Tan

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)

Recommendations

• Tight distance-regular graphs
• scientific article; zbMATH DE number 1379441
• scientific article; zbMATH DE number 6808067
• Restrictions on classical distance-regular graphs
• ON THE NON-EXISTENCE OF CERTAIN DISTANCE-REULAR GRAPHS

Cites work

• scientific article; zbMATH DE number 3884178 (Why is no real title available?)
• scientific article; zbMATH DE number 43547 (Why is no real title available?)
• An inequality on the cosines of a tight distance-regular graph
• Distance-regular graphs
• Distance-regular graphs with or at least half the valency
• Erdős-Ko-Rado theorems. Algebraic approaches
• Krein parameters and antipodal tight graphs with diameter 3 and 4
• On graphs with complete multipartite \(\mu \)-graphs
• Restrictions on classical distance-regular graphs
• Strongly regular graphs
• Strongly regular graphs with smallest eigenvalue -m
• There are only finitely many distance-regular graphs of fixed valency greater than two
• Tight distance-regular graphs
• Tight distance-regular graphs and the \(Q\)-polynomial property
• Tight distance-regular graphs and the subconstituent algebra

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6499981)