Irregular colorings of certain classes of corona product and Sierpiński graphs

Abstract

Let G be a simple connected graph. A coloring of G is said to be irregular if the vertices receives distinct color codes. The minimum number of color codes required to color the graph G is called the irregular chromatic number and it is denoted by χ_ir (G). In this paper, we obtain the irregular coloring number for certain classes of corona product of graphs and Sierinski graphs.

Subject Classification:

• 05C15

Keywords:

• Irregular colorings
• Corona product
• Sierpiński Graphs