THE b-CHROMATIC NUMBER OF HELM GRAPH
Nadeem Ansari Β· International Journal of Advanced Research in Computer Science Β· 2017
The b-chromatic number π(πΊ) of a graph πΊ is the greatest integer k such that πΊ admits a proper k-coloring in which every color class π has a vertex realizing color π that is proficient to correspond with all the others color classes. The paper estimates the π-chromatic number of helm graph, central graph of helm graph and middle graph of helm graph which is denoted by Hn, C(Hn) and π(Hn) respectively.