L(j, k)-labelings of Kronecker products of complete graphs

For positive integers j ≥ k, an L(j, k)-labeling of a graph G is an integer labeling of its vertices such that adjacent vertices receive labels that differ by at least j and vertices that are distance two apart receive labels that differ by at least k. We determine λ k j (G) for the case when G is a Kronecker product of finitely many complete graphs, where there are certain nditions on j and k. Areas of application include frequency allocation to radio transmitters. © 2007 IEEE.