Chromatic completion number of corona of path and cycle graphs
Authors :
Johan Kok
Author Address :
1 Independent Mathematics Researcher, South Africa & Department of Mathematics, CHRIST (Deemed to be a University), Bangalore, India.
*Corresponding author.
Abstract :
Following the introduction of the notion of chromatic completion of a graph, this paper presents results for the \emph{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.
Keywords :
Chromatic completion number, chromatic completion graph, chromatic completion edge.
DOI :
Article Info :
Received : October 05, 2019; Accepted : December 12, 2019.
