A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
On bipartite Q-polynomial distance-regular graphs

2007
*
European journal of combinatorics (Print)
*

Let Γ denote a bipartite Q-polynomial distance-regular graph with vertex set X , diameter d ≥ 3 and valency k ≥ 3. Let R X denote the vector space over R consisting of column vectors with entries in R and rows indexed by X . For z ∈ X , letẑ denote the vector in R X with a 1 in the z-coordinate, and 0 in all other where the sum is over all z ∈ X such that ∂(x, z) = i and ∂(y, z) = j. We define W = span{w i j | 0 ≤ i, j ≤ d}. In this paper we consider the space M W = span{mw | m ∈ M, w ∈ W },

doi:10.1016/j.ejc.2005.09.003
fatcat:7ge2yrvpwbbnnbzn2sqpcpnvl4