Publisher
Mathematical Sciences Publishers
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Root Systems and The Johnson and Hamming Graphs;European Journal of Combinatorics;1987-01
2. The Johnson graph J(d, r) is unique if (d, r) ≠ (2, 8);Discrete Mathematics;1986-02
3. The graphs G(n, k) of the Johnson Schemes are unique for n ≥ 20;Journal of Combinatorial Theory, Series B;1984-10
4. On the uniqueness of the graphs G(n, k) of the Johnson schemes;Journal of Combinatorial Theory, Series B;1982-12
5. Characterization of the graphs of the Johnson schemes G(3k, k) and G(3k + 1, k);Journal of Combinatorial Theory, Series B;1982-12