Irregular colorings of derived graphs of flower graph

A. Rohini ^[1] ; M. Venkatachalam ^[1] ; R. Sangamithra ^[1]
1. [1] Kongunadu Arts and Science College
Localización: SeMA Journal: Boletín de la Sociedad Española de Matemática Aplicada, ISSN-e 2254-3902, ISSN 2254-3902, Vol. 77, Nº. 1, 2020, págs. 47-57
Idioma: inglés
DOI: 10.1007/s40324-019-00201-1
Texto completo no disponible (Saber más ...)
Resumen
- The concept of irregular coloring was established by Radcliffe and Zhang (AKCE J Graphs Combinator 3(2):175–191, 2006). Irregular coloring is a proper coloring, in which distinct vertices have different color codes. In this paper, we find the irregular chromatic number for the following graphs: M(Fn), T(Fn), L(Fn), C(Fn), M(J2,n), T(J2,n), L(J2,n), C(J2,n), M(Wn), T(Wn), L(Wn), C(Wn), M(Bn), T(Bn), L(Bn) and C(Bn).