Packing coloring on subdivision-vertex and subdivision-edge join of cycle Cm with path Pn
The packing chromatic number $\chi_\rho$ of a graph $G$ is the smallest integer $k$ for which there exists a mapping $\pi$ from $V(G)$ to $\{1,2,...,k\}$ such that any two vertices of color $i$ are at distance at least $i+1$. In this paper, the authors find the packing chromatic number of subdivision vertex join of cycle graph with path graph and subdivision edge join of cycle graph with path graph.
2022 ◽
Vol 18
(2)
◽
pp. 161-168
Keyword(s):
2014 ◽
Vol 4
(1)
◽
pp. 27
2021 ◽
Vol 33
(5)
◽
pp. 66-73
Keyword(s):
2018 ◽
Vol 341
(2)
◽
pp. 474-483
◽
2016 ◽
Vol 5
(2)
◽
pp. 132
Keyword(s):
2019 ◽
Vol 1306
◽
pp. 012014
2019 ◽
Vol 1317
◽
pp. 012021
2015 ◽
Vol 32
(4)
◽
pp. 1313-1327
◽