• STAR COLORING OF HELM GRAPH FAMILIES

Abstract

A star coloring of a graph G is a proper vertex coloring (no two adjacent vertices of G has the same color) such that the induced subgraph of any two color classes is a collection of stars. The minimum number of colors needed to star color the vertices of a graph is called its star chromatic number and is denoted by Xs (G). In this research paper, we present coloring algorithms and find the exact value of the star chromatic number of Middle, Total and Central graph of Helm graph families.