Abstract
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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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: Journal of Discrete Mathematical Sciences and Cryptography
Paper Title
Journal
Date
