Chromatic completion number of corona of path and cycle graphs

Abstract

Following the introduction of the notion of chromatic completion of a graph, this paper presents results for the chromatic completion number for the corona operations, $P_n \circ P_m$ and $P_n \circ C_m, n \geq 1$ and $m \geq 1$. From the aforesaid a general result for the chromatic completion number of $P_n \circ K_m$ came to the fore. The paper serves as a basis for further research with regards to the chromatic completion number of corona, join and other graph products.