A Characterization of the Association Schemes of Bilinear Forms
Author:
- 30 April 1987
- journal article
- Published by Elsevier in European Journal of Combinatorics
- Vol. 8 (2) , 159-173
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- The Johnson graph J(d, r) is unique if (d, r) ≠ (2, 8)Discrete Mathematics, 1986
- On the uniqueness of the graphs G(n, k) of the Johnson schemesJournal of Combinatorial Theory, Series B, 1982
- Characterization of H(n, q) by the parametersJournal of Combinatorial Theory, Series A, 1981
- Incidence Structures whose Planes are NetsEuropean Journal of Combinatorics, 1981
- Bilinear forms over a finite field, with applications to coding theoryJournal of Combinatorial Theory, Series A, 1978
- Characterization of projective graphsJournal of Combinatorial Theory, Series B, 1978
- A characterization of the Tm graphJournal of Combinatorial Theory, 1969
- Une caract risation des espaces affins bas e sur la notion de droiteMathematische Zeitschrift, 1969
- A characterization of cubic lattice graphsJournal of Combinatorial Theory, 1967
- A characterization of tetrahedral graphsJournal of Combinatorial Theory, 1967