Title of article
On a Characterization of Bilinear Forms Graphs
Author/Authors
Metsch، نويسنده , , K.، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1999
Pages
14
From page
293
To page
306
Abstract
We show that the bilinear forms graphsHq(n, d) of diameterd ≥ 3 are characterized as distance-regular graphs by their parameters provided that eithern ≥ d + 3 andq ≥ 3, orn ≥ d + 4 andq = 2. As a corollary of the method used, we can show the following. If Γ is a distance-regular graph with classical parameters (d, q, α, β) and diameterd ≥ 3, then either Γ is a Johnson graph, a Grassmann graph, a Hamming graph, or a bilinear forms graph, or β is bounded in terms ofd, qand α.
Journal title
European Journal of Combinatorics
Serial Year
1999
Journal title
European Journal of Combinatorics
Record number
1548020
Link To Document