On the clique covering numbers of Johnson graphs 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 ≤ 3 , and k ≥ N - 3 , and using computational methods, we provide expl...

Celý popis