Johnson graph
= Johnson graph
{c}
{title2=$J(n,k)$}
{wiki}
The Johnson graph has the $k$-element subsets of an $n$-element set as vertices, with two vertices adjacent exactly when their intersection has $k-1$ elements. Relabelling the ground set gives graph automorphisms. The <maximal cliques of a Johnson graph> allow reconstruction of those ground-set labels when the two clique sizes are different.