On Coloring of Corona Graphs

N  Ramya

doi:10.17485/ijst/2014/v7sp3.13

Article

VIEWS 896
PDF 453

Abstract
Full-Text HTML
Full-Text PDF
How to Cite

Indian Journal of Science and Technology

DOI: 10.17485/ijst/2014/v7sp3.13

Year: 2020, Volume: 7, Issue: Supplementary 3, Pages: 9–11

Original Article

On Coloring of Corona Graphs

N. Ramya*

Deptartment of Mathematics, Bharath University, Selaiyur, Chennai, India; nramyas@yahoo.com

This work is licensed under a Creative Commons Attribution 4.0 International License.

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 .

Keywords: Acyclic Coloring, Corona Pn ◉ K2 , Proper Coloring Corona of Cn ◉ K1,3, Star Coloring