Abstract
The packing chromatic number I‡ (G) of a graph G is the smallest integer k for which there exists a mapping I : 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 give the packing chromatic number for some classes of cycles. I
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Mathematics and Soft Computing
Paper Title
Journal
Date
