On the clique covering numbers of Johnson graphs

We initiate a study of the vertex clique covering numbers of Johnson graphs $J(N,k)$, the smallest numbers of cliques necessary to cover the vertices of those graphs. We prove identities for the values of these numbers when $k\le 3$, and $k\ge N-3$, and using computational methods, we provide explicit values for a range of small graphs. By drawing on connections to coding theory and combinatorial design theory, we prove various bounds on the clique covering numbers for general Johnson graphs, and we show how constant-weight lexicodes can be utilized to create optimal covers of $J(2k,k)$ when $k$ is a small power of two.