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

DOI10.37236/12699MaRDI QIDQ6499981FDOQ6499981

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)

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

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

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

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)