On bipartite \(Q\)-polynomial distance-regular graphs with \(c_2 \leqslant 2\)
type: Item
instance of: scholarly article
title: On bipartite \(Q\)-polynomial distance-regular graphs with \(c_2 \leqslant 2\)
zbMATH Open document ID: 1305.05061
published in: The Electronic Journal of Combinatorics
publication date: 2015-01-22T00:00:00Z
full work available at URL: v21i4p53
review text: Summary: Let \(\Gamma\) denote a bipartite \(Q\)-polynomial distance-regular graph with diameter \(D \geqslant 4\), valency \(k \geqslant 3\) and intersection number \(c_2 \leqslant 2\). We show that \(\Gamma\) is either the \(D\)-dimensional hypercube, or the antipodal quotient of the \(2D\)-dimensional hypercube, or \(D=5\).
Mathematics Subject Classification ID: 05C12
Mathematics Subject Classification ID: 05E30
zbMATH DE Number: 6389224
zbMATH Keywords: distance-regular graphs
zbMATH Keywords: \(Q\)-polynomial property
zbMATH Keywords: equitable partitions
author: Štefko Miklavič
author: Safet Penjić
MaRDI profile type: Publication
cites work: Q3218140
cites work: Q3992965
cites work: Bipartite \(Q\)-polynomial distance-regular graphs
cites work: Almost 2-homogeneous bipartite distance-regular graphs
cites work: Distance-regular graphs
cites work: On bipartite \(Q\)-polynomial distance-regular graphs with \(c_{2}=1\)
cites work: A new inequality for distance-regular graphs
description: scientific article; zbMATH DE number 6389224