Maximal $m$-distance sets containing the representation of the Johnson graphs $J(n, m)$

Details Maximal $m$-distance sets containing the representation of the Johnson graphs $J(n, m)$ Maximal $m$-distance sets containing the representation of the Johnson graphs $J(n, m)$

2012-02-07

arxiv.org/abs/1202.1352v1

Mathematics

Combinatorics

10 pages, http://researchmap.jp/j_shigezumi/ESSP2009/ (in Japanese)

Scientific paper

We classify the maximal $m$-distance sets in $\mathbb{R}^{n - 1}$ which contain the representation of the Johnson graphs $J(n, m)$ for $m = 2, 3$. Furthermore, we determine the necessary and sufficient condition for $n$ and $m$ such that the representation of the Johnson graph $J(n, m)$ is not maximal as an $m$-distance set. Also, we classify the maximal two-distance sets in $\mathbb{R}^{n - 1}$ which contain the representation of $J(n - 1, 2)$.

Affiliated with

Also associated with

No associations

Rating

Maximal $m$-distance sets containing the representation of the Johnson graphs $J(n, m)$ does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Maximal $m$-distance sets containing the representation of the Johnson graphs $J(n, m)$, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Maximal $m$-distance sets containing the representation of the Johnson graphs $J(n, m)$ will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-578860