On Coloring of Corona Graphs

Abstract

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 C n ⊙ K 1,3 . P n ⊙ K 2 and star coloring of corona of P n ⊙ K 2 .