Completely regular designs of strength one (Q1321590)

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. Meyerowitz has 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.