Given a graph $G$ and a positive integer $i,$ an $i$-packing in $G$ is a subset $X$ of $V(G)$ such that the distance $d_G(u, v)$ between any two distinct vertices $u,v\,\in\,X$ is greater than $i.$ The packing chromatic number $\chi_{\rho}(G)$ of a graph $G$ is the smallest integer $k$ such that the vertex set of $G$ can be partitioned into sets $V_i,$ $i\in [k],$ where each $V_i$ is an $i$-packing. In this paper, we determine the packing chromatic number of the corona products of paths and cycles of small order (at most $11$ vertices) with an edge and obtain bounds for the packing chromatic number of corona products of paths and cycles of larger order with an edge.
The authors would like to thank the referee for suggestions which improved the presentation of the paper.
| Primary Language | English |
|---|---|
| Subjects | Combinatorics and Discrete Mathematics (Excl. Physical Combinatorics) |
| Journal Section | Research Article |
| Authors | |
| Submission Date | December 17, 2024 |
| Acceptance Date | April 27, 2025 |
| Publication Date | January 8, 2026 |
| Published in Issue | Year 2026 Volume: 16 Issue: 1 |