On Coloring of Corona Graphs
N. Ramya · Indian Journal of Science and Technology · 2014
A proper coloring of a graph is an assignment of colors to the vertices of the graph such that adjacent vertices are assigned different colors. A star coloring of a graph G is a proper coloring such that no path on four vertices is a 2-colored. A coloring of the vertices of graph by K-colors is called acyclic provided that no circuit is bi-chromatic. In this paper we discuss about the acyclic coloring of corona of Cn K1,3. Pn K2 and star coloring of corona of Pn K2 . Keywords: Acyclic Coloring, Corona Pn ◉ K2 , Proper Coloring Corona of Cn ◉ K1,3, Star Coloring