Abstract
Let G be a dual polar graph of type Bd(q) orCd(q). Define a graph Gˆ on the same vertex set by having vertices x and y adjacent in Gˆ if they are of distance 1 or 2 in G. The graph Gˆ was recently shown to be distance-regular [10, 12]. In fact, Gˆ is the halved graph of a bipartite distance-regular graph. When G is of type Cd(q) and q is odd, this bipartite graph is new.
Original language | English |
---|---|
Pages (from-to) | 71-79 |
Journal | European Journal of Combinatorics |
Volume | 13 |
Issue number | 2 |
DOIs | |
Publication status | Published - 1992 |