PACKING CHROMATIC NUMBER OF CERTAIN GRAPHS
Albert William, S. Roy · International Journal of Pure and Apllied Mathematics · 2013
The packing chromatic number χ ρ (G) of a graph G is the smallest integer k for which there exists a mapping Π : V (G) -→ {1, 2, ..., k} such that any two vertices of color i are at distance at least i + 1.It is a frequency assignment problem used in wireless networks, which is also called broadcasting coloring.It is proved that packing coloring is NP-complete for general graphs and even for trees.In this paper, we study the packing chromatic number of comb graph, circular ladder, windmill, H-graph and uniform theta graph.