Title of article
Maximal -distance sets containing the representation of the Johnson graph
Author/Authors
Bannai، نويسنده , , Eiichi and Sato، نويسنده , , Takahiro and Shigezumi، نويسنده , , Junichi، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2012
Pages
10
From page
3283
To page
3292
Abstract
We classify the maximal m -distance sets in R n − 1 which contain the representation of the Johnson graph 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.
we classify the maximal two-distance sets in R n − 1 which contain the representation of J ( n − 1 , 2 ) .
Keywords
Distance sets , Johnson graph
Journal title
Discrete Mathematics
Serial Year
2012
Journal title
Discrete Mathematics
Record number
1600141
Link To Document