Prime Labeling of Grids
Alka V. Kanetkar · AKCE International Journal of Graphs and Combinatorics · 2009
A labeling f on a graph G on n vertices is called a prime labeling if f is a bijection from the vertex set V (G )t o{1,2, ··· ,n} such that f(x )a ndf(y )a re coprime ifx and y are adjacent. It was shown by Sundaram et al. [1] that the planar grid Pm × Pn has a prime labeling if m ≤ n and n is a prime. In this paper it is proved that the following grids have a prime labeling: