Codes and \(L(2,1)\)-labelings in Sierpiński graphs (Q2493639)

The \(\lambda\)-number of a graph \(G\) is the least value of \(\lambda\) such that the vertices of \(G\) can be labeled from \(\{0, 1, \dots , \lambda\}\) in such a way that adjacent vertices get labels which are at least two apart and vertices at distance two get different labels from one another. A {perfect code} in a graph \(G\) is a set \(C \subset V(G)\) such that the closed neighborhoods of elements of \(C\) partition \(V(G)\). Using perfect codes in the Sierpiński graphs \(S(n,k)\) the authors prove that \(\lambda \left( S(n,k) \right)=2k\). Along the way they produce a new proof of the second author's 2002 classification of such codes.