On bipartite \(Q\)-polynomial distance-regular graphs with \(c_{2}=1\)

DOI10.1016/j.disc.2005.09.044zbMath1112.05104OpenAlexW2084815547MaRDI QIDQ864145

Štefko Miklavič

Publication date: 13 February 2007

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2005.09.044

zbMATH Keywords

equitable partition

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30)

Related Items (4)

Bipartite \(Q\)-polynomial distance-regular graphs and uniform posets ⋮ On bipartite \(Q\)-polynomial distance-regular graphs with \(c_2 \leqslant 2\) ⋮ A combinatorial basis for Terwilliger algebra modules of a bipartite distance-regular graph ⋮ On the Terwilliger algebra of bipartite distance-regular graphs with \(\Delta_{2}=0\) and \(c_{2}=1\)

Cites Work

• Unnamed Item
• Unnamed Item
• Almost-bipartite distance-regular graphs with the \(Q\)-polynomial property
• Homogeneous graphs and regular near polygons
• A new inequality for distance-regular graphs
• Problems in algebraic combinatorics
• The last subconstituent of a bipartite \(Q\)-polynomial distance-regular graph
• 2-homogeneous bipartite distance-regular graphs
• Homotopy in \(Q\)-polynomial distance-regular graphs
• \(Q\)-polynomial distance-regular graphs with \(a_1=0\)
• Spin models on bipartite distance-regular graphs

This page was built for publication: On bipartite \(Q\)-polynomial distance-regular graphs with \(c_{2}=1\)