Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4648180 | Discrete Mathematics | 2012 | 10 Pages |
Abstract
We classify the maximal mm-distance sets in Rn−1Rn−1 which contain the representation of the Johnson graph J(n,m)J(n,m) for m=2,3m=2,3. Furthermore, we determine the necessary and sufficient condition for nn and mm such that the representation of the Johnson graph J(n,m)J(n,m) is not maximal as an mm-distance set.Also, we classify the maximal two-distance sets in Rn−1Rn−1 which contain the representation of J(n−1,2)J(n−1,2).
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Eiichi Bannai, Takahiro Sato, Junichi Shigezumi,