Electronic Resource
Springer
Journal of algebraic combinatorics
3 (1994), S. 177-185
ISSN:
1572-9192
Keywords:
completely regular subset
;
equitable partition
;
Johnson graph
;
t-design
Source:
Springer Online Journal Archives 1860-2000
Topics:
Mathematics
Notes:
Abstract We study a class of highly regular t-designs. These are the subsets of vertices of the Johnson graph which are completely regular in the sense of Delsarte [2]. In [9], Meyerowitz classified the completely regular designs having strength zero. In this paper, we determine the completely regular designs having strength one and minimum distance at least two. The approach taken here utilizes the incidence matrix of (t+1)-sets versus k-sets and is related to the representation theory of distance-regular graphs [1, 5].
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1023/A:1022493523470
Permalink
|
Location |
Call Number |
Expected |
Availability |
