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 chi(ir)(G). In this paper, we obtain the irregular coloring number for certain classes of corona product of graphs and Sierinski graphs.
机构:
Univ Bordeaux, LaBRI, UMR 5800, F-33400 Talence, France
CNRS, LaBRI, UMR 5800, F-33400 Talence, FranceUniv Bordeaux, LaBRI, UMR 5800, F-33400 Talence, France
机构:
Univ Nottingham Ningbo China, Sch Math Sci, Ningbo, Peoples R China
Univ Nottingham Ningbo China, Sch Math Sci, 199 Taikang East Rd, Ningbo 315100, Peoples R ChinaUniv Nottingham Ningbo China, Sch Math Sci, Ningbo, Peoples R China