All graph in this paper is connected graph. Let du,v be a distance between any vertex u and v in graph GV,E. A function c :VG 1, 2, , k is called a packing k  coloring if every two vertex of color i are ...