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.
机构:
Chongqing Univ, Sch Econ & Business Adm, Chongqing 400044, Peoples R China
Chongqing Univ, Coll Math & Stat, Chongqing 400044, Peoples R ChinaChongqing Univ, Sch Econ & Business Adm, Chongqing 400044, Peoples R China
机构:
PG & Research Department of Mathematics, Kongunadu Arts and Science College, Coimbatore, 641 029, Tamil NaduPG & Research Department of Mathematics, Kongunadu Arts and Science College, Coimbatore, 641 029, Tamil Nadu
Rohini A.
Venkatachalam M.
论文数: 0引用数: 0
h-index: 0
机构:
PG & Research Department of Mathematics, Kongunadu Arts and Science College, Coimbatore, 641 029, Tamil NaduPG & Research Department of Mathematics, Kongunadu Arts and Science College, Coimbatore, 641 029, Tamil Nadu
Venkatachalam M.
Sangamithra R.
论文数: 0引用数: 0
h-index: 0
机构:
PG & Research Department of Mathematics, Kongunadu Arts and Science College, Coimbatore, 641 029, Tamil NaduPG & Research Department of Mathematics, Kongunadu Arts and Science College, Coimbatore, 641 029, Tamil Nadu