Star–in–coloring of Some Special Graphs

A. Sugumaran and P. Kasirajan

Department of Mathematics, Government Arts College, Tiruvannamalai – 606 603, Tamil Nadu, INDIA.


A proper coloring of a graph 𝐺=(𝑉,𝐸) is a mapping 𝑓:𝑉→𝑁such that if 𝑣𝑖𝑣𝑗𝜖 𝐸 then 𝑓(𝑣𝑖)≠𝑓(𝑣𝑗). In this paper we investigate the lower and upper bounds for the star–in–chromatic number of the graphs such as cycle, regular cyclic, gear, fan, double fan, web and complete binary tree. In addition we have given the general coloring pattern of all these graphs and their star–in–chromatic number. AMS Subject Classification: 05C15, 05C20.

Keywords :Coloring, Star–in–coloring, Star–in–chromatic number.

map1 map2 map3