International Journal of Academic and Applied Research (IJAAR)   Year: 2020 | Volume: 4 | Issue: 1 | Page No.: 1-9 On The Packing Coloring Of Unicyclic Graph Family Regina Ariningtyas, Arika Indah Kristiana, Dafik Abstract: All graph in this paper is connected graph. Let be a distance between any vertex and in graph . A function is called a packing coloring if every two vertex of color are at least distance. or packing chromatics number of graph is the smallest integer of which has packing coloring. Unicyclic graphs are graphs that only have one cycle. This graphs is denoted by , which is the length of the unicyclic graph. In this paper, we will study about packing coloring of graphs and determine their packing chromatic number. We have found the exact values of the packing coloring of unicyclic graph family.