On irregular colorings of double wheel graph families

Abstract

An assignment of colors to the vertices of a graph, so that no two adjacent vertices get the same color is called a proper coloring. An irregular coloring of a graph is a proper vertex coloring that distinguishes vertices in the graph either by their own colors or by the colors of their neighbours. In this paper, we investigate the irregular chromatic number for the middle graph, total graph, central graph and line graph of double wheel 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. Michalak, Danuta, On middle and total graphs with coarseness number equal 1, Springer Verlag Graph Theory, Lagow proceedings, Berlin Heidelberg, New York, Tokyo, (1981), 139-150.
2. Harary, F., Graph Theory, Narosa Publishing home, New Delhi, 1969.
3. Radcliffe, M. and Zhang, P., Irregular coloring of graphs, Bull. Inst. Combin. Appl.,49, (2007), 41-59.
4. Radcliffe, M. and Zhang, P., On Irregular coloring of graphs, AKCE. J. Graphs. Combin.,3, No. 2, (2006),175-191.
5. Le Bras, Ronan, Gomes, Carla P. and Selman, Bart, Double- Wheel Graphs are Graceful, Proceedings of the Twenty third International Joint Conference on Artificial Intelligence, (2013),587-593.
6. Vernold Vivin, J., Harmonious coloring of total graphs, n-leaf, central graphs and circumdetic graphs, Bharathiar University, Ph.D Thesis, Coimbatore, India 2007.
7. Vernold Vivin, J., Venkatachalam, M. and Akbar Ali, M. M., Achromatic coloring on double star graph families, International Journal of Mathematics Combinatorics, 3, (2009), 71-81.