Resumen de Irregular colorings of derived graphs of flower graph
A. Rohini, M. Venkatachalam, R. Sangamithra
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).
