Indian Journal of Science and Technology

Open Access Open Access  Restricted Access Subscription Access

On Coloring of Corona Graphs


Affiliations
1 Deptartment of Mathematics, Bharath University, Selaiyur, Chennai, India
 

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.
User

Abstract Views: 245

PDF Views: 0




  • On Coloring of Corona Graphs

Abstract Views: 245  |  PDF Views: 0

Authors

N. Ramya
Deptartment of Mathematics, Bharath University, Selaiyur, Chennai, India

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 Cn ⊙ K1,3. Pn ⊙ K2 and star coloring of corona of Pn ⊙ K2.


DOI: https://doi.org/10.17485/ijst%2F2014%2Fv7iS3%2F50338