Packing chromatic number of certain fan and wheel related graphs

The packing chromatic number χρ(G) 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 compute the packing chromatic number for certain fan and wheel related graphs.