On bipartite \(Q\)-polynomial distance-regular graphs with \(c_2 \leqslant 2\) (Q490271)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On bipartite \(Q\)-polynomial distance-regular graphs with \(c_2 \leqslant 2\) |
scientific article; zbMATH DE number 6389224
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On bipartite \(Q\)-polynomial distance-regular graphs with \(c_2 \leqslant 2\) |
scientific article; zbMATH DE number 6389224 |
Statements
On bipartite \(Q\)-polynomial distance-regular graphs with \(c_2 \leqslant 2\) (English)
0 references
22 January 2015
0 references
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\).
0 references
distance-regular graphs
0 references
\(Q\)-polynomial property
0 references
equitable partitions
0 references
