PCCP of wheel graph family with null, chain, fan and cycle graph
Abstract
A function f: P(G)∪L(G)∪R(G)→C is said to be perfect coloring of the graph G, if f(x)≠f(y) for any two adjoint or incident elements x,y∈P(G)∪L(G)∪R(G). And the PC number χP(G) is the least colors needed to color a graph by using perfect coloring. In this paper, we prove the results for perfect coloring of corona product(PCCP) of wheel graph family with null, chain, fan and cycle graph, which leads to perfect chromatic number equivalent to ∆+1, where ∆ is the largest degree of the resultant graph in corona product.
Copyright © 2021 A.A. Bhange, H.R. Bhapkar. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Cite this article
A. A. Bhange, H. R. Bhapkar, PCCP of wheel graph family with null, chain, fan and cycle graph, J. Math. Comput. Sci. 11 (2021), 1676–1686. https://doi.org/10.28919/jmcs/5397
BibTeX
@article{Bhange2021,
author = {Bhange, A.A. and Bhapkar, H.R.},
title = {PCCP of wheel graph family with null, chain, fan and cycle graph},
journal = {J. Math. Comput. Sci.},
volume = {11},
year = {2021},
pages = {1676--1686},
doi = {10.28919/jmcs/5397}
}