International Journal of Computer Applications |
Foundation of Computer Science (FCS), NY, USA |
Volume 44 - Number 23 |
Year of Publication: 2012 |
Authors: R. Arundhadhi, R. Sattanathan |
10.5120/6429-8927 |
R. Arundhadhi, R. Sattanathan . Star Coloring of Wheel Graph Families. International Journal of Computer Applications. 44, 23 ( April 2012), 26-29. DOI=10.5120/6429-8927
A star coloring of a graph G is a proper vertex coloring (no two adjacent vertices of G have the same color) such that every path of G on four vertices, is not bicolored. The minimum number of colors needed to star color G is called as star chromatic number and is denoted by XS(G). In this paper, we give the exact value of star chromatic number of middle, central and total graph of wheel graph families Wn.