Bipartite Q-polynomial distance-regular graphs
Let \(\Gamma\) denote a bipartite \(Q\)-polynomial distance-regular graph with diameter \(D\geq 4\). Then the intersection numbers of \(\Gamma\) are determined by \(D\) and two real scalars \(q\) and \(s^*\). It is proved that \(s^*=0\) if \(D\geq 12\). Theorem 1.1. Let \(\Gamma\) be a bipartite distance-regular graph with diameter \(D\geq 12\). Then \(\Gamma\) is \(Q\)-polynomial if and only if the following conditions (i)--(iv) hold: (i) \(\Gamma\) is the ordinary \(2D\)-cycle. (ii) \(\Gamma\) is the Hamming cube \(H(D,2)\). (iii) \(\Gamma\) is the antipodal quotient of \(H(2D,2)\). (iv) The intersection numbers of \(\Gamma\) satisfy \[ c_i=\frac{q^i-1}{q-1},\;b_i=\frac{q^D-q^i}{q-1},\;(0\leq i\leq D), \] where \(q\) is an integer not less than 2. The intersection numbers given in the case (iv) above are realized by both the bipartite dual polar graphs and the Hemmeter graph.
- On bipartite \(Q\)-polynomial distance-regular graphs with diameter 9, 10, or 11
- On bipartite Q-polynomial distance-regular graphs with c₂ 2
- On bipartite \(Q\)-polynomial distance-regular graphs with \(c_{2}=1\)
- The last subconstituent of a bipartite Q-polynomial distance-regular graph
- Bipartite Q-polynomial quotients of antipodal distance-regular graphs
- Distance-regular graphs which support a spin model are thin
- The Terwilliger algebras of bipartite P- and Q-polynomial schemes
- Bipartite Q-polynomial quotients of antipodal distance-regular graphs
- Distance-regular graphs with \(b_ i=c_{d-i}\) and two P-polynomial structures
- The last subconstituent of a bipartite Q-polynomial distance-regular graph
- Leaves in representation diagrams of bipartite distance-regular graphs
- The parameters of bipartite \(Q\)-polynomial distance-regular graphs
- On bipartite \(Q\)-polynomial distance-regular graphs with diameter 9, 10, or 11
- A characterization of \(Q\)-polynomial distance-regular graphs using the intersection numbers
- Dual bipartite Q-polynomial distance-regular graphs
- Twice Q-polynomial distance-regular graphs
- On bipartite distance-regular graphs with intersection numbers \(c_{i} = (q^{i}-1)/(q-1)\)
- The local structure of a bipartite distance-regular graph
- Twice Q-polynomial distance-regular graphs of diameter 4
- On Perfect P-polynomial Table Algebras
- Bipartite Q-polynomial distance-regular graphs and uniform posets
- scientific article; zbMATH DE number 3906524 (Why is no real title available?)
- Triple intersection numbers of Q-polynomial distance-regular graphs
- scientific article; zbMATH DE number 1379440 (Why is no real title available?)
- On bipartite Q-polynomial distance-regular graphs with c₂ 2
- A diagram associated with the subconstituent algebra of a distance-regular graph
- A \(Q\)-polynomial structure for the attenuated space poset \(\mathcal{A}_q (N, M)\)
- On the Q-polynomial property of the full bipartite graph of a Hamming graph
- Dual bipartite \(Q\)-polynomial distance-regular graphs and dual uniform structures
- A classification of Q-polynomial distance-regular graphs with girth 6
- The Terwilliger algebras of bipartite Q-polynomial distance-regular graphs
- Divisibility conditions for intersection numbers of certain bipartite distance-regular graphs
- Uniform equations for bipartite graphs and the center of a Terwilliger algebra
- On bipartite Q-polynomial distance-regular graphs
- Almost-bipartite distance-regular graphs with the Q-polynomial property
- On bipartite \(Q\)-polynomial distance-regular graphs with \(c_{2}=1\)
- The last subconstituent of the Hemmeter graph
- A characterization of Q-polynomial distance-regular graphs
- A duality between pairs of split decompositions for a Q-polynomial distance-regular graph
This page was built for publication: Bipartite \(Q\)-polynomial distance-regular graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1889840)
