\(L(2,1)\)-labeling of direct product of paths and cycles (Q1764815): Difference between revisions

An \(L(2,\, 1)\)-labeling of a graph \(G\) is an assignment of labels from \(\{0,1,\dots,\lambda\}\) to the vertices of \(G\) such that vertices at distance two get different labels and adjacent vertices get labels that are at least two apart. The \(\lambda\)-number of \(G\) is the minimum value \(\lambda\), such that \(G\) admits an \(L(2,\, 1)\)-labeling. The authors establish \(\lambda\)-numbers for certain products of cycles and paths.