Abstract
T. A. Dowling (J. Combin. Theory6 (1969), 251-263) proved the uniqueness of the graphs G(n, k) of the Johnson schemes for n > 2k(k - 1) + 4. We improve this result by showing the uniqueness of G(n, k) for n > 4k. © 1982.
Cite
CITATION STYLE
APA
Moon, A. (1982). On the uniqueness of the graphs G(n, k) of the Johnson schemes. Journal of Combinatorial Theory, Series B, 33(3), 256–264. https://doi.org/10.1016/0095-8956(82)90045-4
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free