On packing coloring of helm related graphs
K. Rajalakshmi, Mathiyazhagan Venkatachalam · Journal of Discrete Mathematical Sciences and Cryptography · 2019
The packing chromatic number χp 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. In this paper, we give the packing chromatic number for the middle graph, total graph, central graph and line graph of helm graph and closed helm graph.