Labeling trees with a condition at distance two. (Q1402073)

The authors consider integer labelings of graphs \(G\) with the properties that the labels of adjacent vertices differ by at least \(j\) and the labels of vertices whose distance is two differ by at least \(k\) where \(j\geq k\). A labeling of that type is called an \(L(j,k)\)-labeling of \(G\). The number \(\lambda_{j,k}(G)\) denotes the minimum span over all \(L(j,k)\)-labelings of \(G\). The main derivation of the paper yields the number \(\lambda_{j,k}(T)\) for infinite regular trees \(T\).