On irregular coloring of wheel related graphs

Abstract

An irregular coloring is a proper coloring in which distinct vertices have different color codes. In this paper, we obtain the irregular chromatic number for middle graph, total graph, central graph and line graph of wheel graph, helm graph, gear graph and closed helm graph.

Keywords

• Irregular coloring,middle graph,total graph,central graph,line graph

References

1. Anderson, M. Vitray, R. and Yellen, J., Irregular colorings of regular graphs, Discrete Mathematics, 312, No. 15, (2012), 2329-2336.
2. Michalak, D., On middle and total graphs with coarseness number equal 1, Springer Verlag Graph Theory, Lagow proceedings, Berlin Heidelberg, New York, Tokyo, (1981), 139-150.
3. Harary, F., Graph Theory, Narosa Publishing home, New Delhi, 1969.
4. Radcliffe, M. and Zhang, P., Irregular coloring of graphs, Bull. Inst. Combin. Appl.,49, (2007), 41-59.
5. Radcliffe, M. and Zhang, P., On Irregular coloring of graphs, AKCE. J. Graphs. Combin.,3, No. 2, (2006),175-191.
6. Vivin, J. V., Harmonious coloring of total graphs, n-leaf, central graphs and circumdetic graphs, Bharathiar University, Ph.D Thesis, Coimbatore, India. 2007. Vivin, J.V., Venkatachalam, M. and Akbar, M. M. A., Achromatic coloring on double star graph families, International Journal of Mathematics Combinatorics, 3, (2009), 71-81.