forms over finite fields. The emphasis is placed on geometric and combinatorial objects, rather than the orthogonal group itself. Our goal is to introduce dual polar spaces as distance-transitive graphs in a self contained way. Prerequisites are linear algebra, and finite fields. In the later part of the lecture, familiarity with counting the number of subspaces of a vector space over a finite field is helpful. This lecture note is not intended as a full account of dual polar spaces. It merely treats those of type Dn(q), Bn(q) and 2Dn(q). One can treat other types, namely, those coming from symplectic groups and unitary groups, in a uniform manner, but I decided to restrict our attention to the above three types in order to save time. Once ...
AbstractLetG be a dual polar graph of typeBd(q) orCd(q). Define a graphGˆ on the same vertex set by ...
AbstractA new inequality for the parameters of distance-regular graphs is proved. It implies that if...
A resolving set for a graph $\Gamma$ is a collection of vertices $S$, chosen so that for each vertex...
AbstractLet δ=0,1 or 2, and let AOG(2ν+δ,Fq) be the (2ν+δ)-dimensional affine-orthogonal space over ...
AbstractThe connected components of the induced graphs on each subconstituent of the dual polar grap...
AbstractLet Fq be the finite field with q elements. Denote by Γ(δ) the dual polar graph of (2ν+δ)-di...
AbstractThe connected components of the induced graphs on each subconstituent of the dual polar grap...
AbstractBrouwer, Godsil, Koolen and Martin [Width and dual width of subsets in polynomial associatio...
Let G be a dual polar graph of type Bd(q) orCd(q). Define a graph Gˆ on the same vertex set by havin...
Let G be a dual polar graph of type Bd(q) orCd(q). Define a graph Gˆ on the same vertex set by havin...
Let G be a dual polar graph of type Bd(q) orCd(q). Define a graph Gˆ on the same vertex set by havin...
Let G be a dual polar graph of type Bd(q) orCd(q). Define a graph Gˆ on the same vertex set by havin...
Let G be a dual polar graph of type Bd(q) orCd(q). Define a graph Gˆ on the same vertex set by havin...
AbstractLetG be a dual polar graph of typeBd(q) orCd(q). Define a graphGˆ on the same vertex set by ...
AbstractIt is shown that the cliques in a distance-regular graph Γ whose parameters are that of the ...
AbstractLetG be a dual polar graph of typeBd(q) orCd(q). Define a graphGˆ on the same vertex set by ...
AbstractA new inequality for the parameters of distance-regular graphs is proved. It implies that if...
A resolving set for a graph $\Gamma$ is a collection of vertices $S$, chosen so that for each vertex...
AbstractLet δ=0,1 or 2, and let AOG(2ν+δ,Fq) be the (2ν+δ)-dimensional affine-orthogonal space over ...
AbstractThe connected components of the induced graphs on each subconstituent of the dual polar grap...
AbstractLet Fq be the finite field with q elements. Denote by Γ(δ) the dual polar graph of (2ν+δ)-di...
AbstractThe connected components of the induced graphs on each subconstituent of the dual polar grap...
AbstractBrouwer, Godsil, Koolen and Martin [Width and dual width of subsets in polynomial associatio...
Let G be a dual polar graph of type Bd(q) orCd(q). Define a graph Gˆ on the same vertex set by havin...
Let G be a dual polar graph of type Bd(q) orCd(q). Define a graph Gˆ on the same vertex set by havin...
Let G be a dual polar graph of type Bd(q) orCd(q). Define a graph Gˆ on the same vertex set by havin...
Let G be a dual polar graph of type Bd(q) orCd(q). Define a graph Gˆ on the same vertex set by havin...
Let G be a dual polar graph of type Bd(q) orCd(q). Define a graph Gˆ on the same vertex set by havin...
AbstractLetG be a dual polar graph of typeBd(q) orCd(q). Define a graphGˆ on the same vertex set by ...
AbstractIt is shown that the cliques in a distance-regular graph Γ whose parameters are that of the ...
AbstractLetG be a dual polar graph of typeBd(q) orCd(q). Define a graphGˆ on the same vertex set by ...
AbstractA new inequality for the parameters of distance-regular graphs is proved. It implies that if...
A resolving set for a graph $\Gamma$ is a collection of vertices $S$, chosen so that for each vertex...