Search
Close this search box.

Contents

Journal of Combinatorial Mathematics and Combinatorial Computing

  • Research article

Equitable Coloring on Corona Graph of Graphs

KALIRAJ. K1, Veninstine Vivik. J2, VERNOLD VIVIN. J3
1Department of Mathematics, R.V.S.College of Engineering and Technology, Coimbatore 641 402, Tamil Nadu, India
2Department of Mathematics, Karunya University, Coimbatore 641 114, Tamil Nadu, India.
3Department of Mathematics, University College of Engineering Nagercoil, Anna University of Technology Tirunelveli (Nagercoil Campus), Nagercoil 629 004, Tamil Nadu, India.
  • Published: 31/05/2012

Abstract

The notion of equitable coloring was introduced by Meyer in 1973. This paper presents exact values of the equitable chromatic number of three corona graphs, which include the complete graph and its complement \( K_m \circ \overline{K_n} \), the star graph and its complement \( K_{1,m} \circ \overline{K_{1,n}} \), and the complete graph and complete graph \( K_m \circ K_n \).

Keywords: Equitable coloring, Corona graph.
Information
Guidelines
CP Initiatives
Follow CP
Facebook Twitter Linkedin
1970-2024 CP (Manitoba, Canada) unless otherwise stated.
Citation
KALIRAJ. K, Veninstine Vivik. J, VERNOLD VIVIN. J. Equitable Coloring on Corona Graph of Graphs[J], Journal of Combinatorial Mathematics and Combinatorial Computing, Volume 081. 191-197. DOI: .