The Johnson graph J(d, r) is unique if (d, r) ≠ (2, 8)
Open Access
- 28 February 1986
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 58 (2) , 175-189
- https://doi.org/10.1016/0012-365x(86)90160-3
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Line graphs, root systems, and elliptic geometryPublished by Elsevier ,2004
- Characterization of the odd graphs Ok by parametersDiscrete Mathematics, 1982
- Characterization of the graphs of the Johnson schemes G(3k, k) and G(3k + 1, k)Journal of Combinatorial Theory, Series B, 1982
- On the uniqueness of the tetrahedral association schemesJournal of Combinatorial Theory, Series B, 1977
- A characterization of the Tm graphJournal of Combinatorial Theory, 1969
- On the tetrahedral graphPacific Journal of Mathematics, 1968
- A characterization of tetrahedral graphsJournal of Combinatorial Theory, 1967
- On the Uniqueness of the Triangular Association SchemeThe Annals of Mathematical Statistics, 1960
- On a Characterization of the Triangular Association SchemeThe Annals of Mathematical Statistics, 1959
- The Uniqueness of the Triangular Association SchemeThe Annals of Mathematical Statistics, 1958