On bipartite Q-polynomial distance-regular graphs with c₂=1
Let \(\Gamma \) denote a bipartite \(Q\)-polynomial distance-regular graph with diameter greater than or equal to three, valency \(k\geq 3\) and intersection number \(c_{2}=1\). In this paper it is shown that \(\Gamma \) has a certain equitable partition of its vertex set which involves \(4d-4\) cells. This partition is used to show that the intersection numbers \(a_{i},b_{i},c_{i}\) of \(\Gamma \) satisfy the following divisibility conditions: \(c_{i+1}-1\) divides \(c_{i}(c_{i}-1)\) for \(2\leq i\leq d-1\), \(b_{i-1}-1\) divides \(b_{i}(b_{i}-1)\) for \(1\leq i\leq d-1\) and \(k-2\) divides \((c_{3}-1)(c_{3}-2)\). Using these divisibility conditions it is shown that there does not exist a bipartite \(Q\)-polynomial distance-regular graph with valency \(k\geq 3\), \(c_{2}=1\) and diameter \(d=4\).
- On bipartite Q-polynomial distance-regular graphs with c₂ 2
- Bipartite \(Q\)-polynomial distance-regular graphs
- The parameters of bipartite \(Q\)-polynomial distance-regular graphs
- Almost-bipartite distance-regular graphs with the Q-polynomial property
- Bipartite Q-polynomial distance-regular graphs and uniform posets
- Dual bipartite Q-polynomial distance-regular graphs
- Bipartite distance-regular graphs: the Q-polynomial property and pseudo primitive idempotents
- Bipartite Q-polynomial quotients of antipodal distance-regular graphs
- Q-polynomial distance-regular graphs with a₁=0 and a₂ 0
- Distance-regular graphs with \(b_ i=c_{d-i}\) and two P-polynomial structures
- 2-homogeneous bipartite distance-regular graphs
- \(Q\)-polynomial distance-regular graphs with \(a_1=0\)
- A new inequality for distance-regular graphs
- Almost-bipartite distance-regular graphs with the Q-polynomial property
- Homogeneous graphs and regular near polygons
- Homotopy in Q-polynomial distance-regular graphs
- scientific article; zbMATH DE number 3884178 (Why is no real title available?)
- scientific article; zbMATH DE number 43547 (Why is no real title available?)
- Problems in algebraic combinatorics
- Spin models on bipartite distance-regular graphs
- The last subconstituent of a bipartite Q-polynomial distance-regular graph
- 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
- The parameters of bipartite \(Q\)-polynomial distance-regular graphs
- On bipartite \(Q\)-polynomial distance-regular graphs with diameter 9, 10, or 11
- Dual bipartite Q-polynomial distance-regular graphs
- Bipartite \(Q\)-polynomial distance-regular graphs
- A combinatorial basis for Terwilliger algebra modules of a bipartite distance-regular graph
- Bipartite Q-polynomial distance-regular graphs and uniform posets
- The local eigenvalues of a bipartite distance-regular graph
- On bipartite Q-polynomial distance-regular graphs with c₂ 2
- On the Terwilliger algebra of bipartite distance-regular graphs with \(\Delta_{2}=0\) and \(c_{2}=1\)
- Characterizing bipartite distance-regularized graphs with vertices of eccentricity 4
- A classification of Q-polynomial distance-regular graphs with girth 6
- Divisibility conditions for intersection numbers of certain bipartite distance-regular graphs
- An equitable partition for the distance-regular graph of the bilinear forms
- A duality between pairs of split decompositions for a Q-polynomial distance-regular graph
This page was built for publication: On bipartite \(Q\)-polynomial distance-regular graphs with \(c_{2}=1\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q864145)
