Journal article

Publication year: 1999

Pages: 293-306

Journal: European Journal of Combinatorics

Volume number: 20

Issue number: 4

ISSN: 0195-6698

Open access status: Bronze

DOI Link: https://doi.org/10.1006/eujc.1998.0280

Publisher: Elsevier

Abstract: 
We show that the bilinear forms graphs H-q(n, d) of diameter d greater than or equal to 3 are characterized as distance-regular graphs by their parameters provided that either n greater than or equal to d + 3 and q greater than or equal to 3, or n greater than or equal to d + 4 and q = 2. As a corollary of the method used, we can show the following. If Gamma is a distance-regular graph with classical parameters (d, q, alpha, beta) and diameter d greater than or equal to 3, then either Gamma is a Johnson graph, a Grassmann graph, a Hamming graph, or a bilinear forms graph, or beta is bounded in terms of d, q and ct. (C) 1999 Academic Press.

Harvard Citation style: Metsch, K. (1999) On a characterization of bilinear forms graphs, European Journal of Combinatorics, 20(4), pp. 293-306. https://doi.org/10.1006/eujc.1998.0280

APA Citation style: Metsch, K. (1999). On a characterization of bilinear forms graphs. European Journal of Combinatorics. 20(4), 293-306. https://doi.org/10.1006/eujc.1998.0280