On bipartite \(Q\)-polynomial distance-regular graphs with \(c_2 \leqslant 2\)

zbMath1305.05061MaRDI QIDQ490271

Štefko Miklavič, Safet Penjić

Publication date: 22 January 2015

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

Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v21i4p53

zbMATH Keywords

distance-regular graphs\(Q\)-polynomial propertyequitable partitions

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Distance in graphs (05C12)

Related Items

On the Terwilliger algebra of bipartite distance-regular graphs with \(\Delta_2 = 0\) and \(c_2 = 2\)

Cites Work

• Unnamed Item
• Unnamed Item
• Distance-regular graphs
• On bipartite \(Q\)-polynomial distance-regular graphs with \(c_{2}=1\)
• A new inequality for distance-regular graphs
• Almost 2-homogeneous bipartite distance-regular graphs
• Bipartite \(Q\)-polynomial distance-regular graphs

This page was built for publication: On bipartite \(Q\)-polynomial distance-regular graphs with \(c_2 \leqslant 2\)