Triple intersection numbers of \(Q\)-polynomial distance-regular graphs

DOI10.1016/J.EJC.2012.02.005zbMath1247.05275OpenAlexW1996350819MaRDI QIDQ427810

Matjaž Urlep

Publication date: 18 June 2012

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2012.02.005

zbMATH Keywords

linear Diophantine equationsTerwilliger balanced set conditions

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30)

Related Items (9)

On the coset graph construction of distance-regular graphs ⋮ Inverse problems in the theory of distance-regular graphs ⋮ Restrictions on classical distance-regular graphs ⋮ Implications of vanishing Krein parameters on Delsarte designs, with applications in finite geometry ⋮ On tight 4-designs in Hamming association schemes ⋮ The Terwilliger polynomial of a \(Q\)-polynomial distance-regular graph and its application to pseudo-partition graphs ⋮ On few-class Q-polynomial association schemes: feasible parameters and nonexistence results ⋮ Using symbolic computation to prove nonexistence of distance-regular graphs ⋮ On some recent progress in the classification of (\(P\) and \(Q\))-polynomial association schemes

Cites Work

• Unnamed Item
• Using equality in the Krein conditions to prove nonexistence of certain distance-regular graphs
• A new inequality for distance-regular graphs
• Problems in algebraic combinatorics

This page was built for publication: Triple intersection numbers of \(Q\)-polynomial distance-regular graphs