Browsing LSP-Jurnal Ilmiah Dosen by Subject "Packing k -coloring"
Now showing items 1-1 of 1
(International Journal of Academic and Applied Research (IJAAR), Vol. 4 Issue 1, January – 2020, Pages: 1-9, 2020-01-09)All graph in this paper is connected graph. Let du,v be a distance between any vertex u and v in graph GV,E. A function c :VG 1, 2, , k is called a packing k coloring if every two vertex of color i are ...