Characterization of the graphs of the Johnson schemes G(3k, k) and G(3k + 1, k)
- 1 December 1982
- journal article
- Published by Elsevier in Journal of Combinatorial Theory, Series B
- Vol. 33 (3) , 213-221
- https://doi.org/10.1016/0095-8956(82)90040-5
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Characterization of the odd graphs Ok by parametersDiscrete Mathematics, 1982
- On the uniqueness of the tetrahedral association schemesJournal of Combinatorial Theory, Series B, 1977
- A characterization problem in graph theoryJournal of Combinatorial Theory, 1969
- On the tetrahedral graphPacific Journal of Mathematics, 1968
- A characterization of tetrahedral graphsJournal of Combinatorial Theory, 1967
- On a Characterization of the Triangular Association SchemeThe Annals of Mathematical Statistics, 1959