On achromatic number of central graph of some graphs

Abstract

The concept of coloring a graph will lead to the definition of a complete n- coloring of a graph G which results the achromatic number ψ(G) where the maximum number of colors required for the points of G in which every pair of colors appears on at least one pair of adjacent vertices. In this paper, we obtain the achromatic number for the Central graph of Ladder graph, Central graph of Dutch-Windmill graph, Central graph of Fan graph and Central graph of Flower graph is denoted as ψ[C(L_{n})], ψ[C(D₃⁽ⁿ⁾)], ψ[C(F_{m,n})] and ψ[C(FL_{n})] respectively.

Keywords

• Achromatic coloring,achromatic number,central graph

References

1. Bondy, J.A.and Murty, U.S.R., Graph theory with applications, London : MacMillan, 1976.
2. West, Douglas B., Introduction to graph theory, Second edition, Prentice-Hall of India Private Limited, New Delhi, 2006.
3. Harary, Frank, Hedetniemi, Stephen and Prins, Geert, An interpolation theorem for graphical Homomorphisms, Portugaliae Mathematica, 26-Fasc.4 (1967), 453-462.
4. Jonathan Gross and Jay Yellen, Hand book of Graph theory, CRC Press, New York, 2004.
5. Mohanapriya, N.,Vernold, Vivin J., Venkatachalam, M., On Dynamic coloring of Fan graphs, International Journal of Pure and Applied Mathematics, Volume 106, No. 8 (2016), 169-174.
6. Nithyadevi, N. and Vijayalakshmi, D., On Achromatic Coloring of C(CH_{n}), C(Y_{n}), C(D(T_{n})) and L(K_{m,n}), IAETSD Journal for Advanced Research in Applied Sciences, Volume 5, No. 4 (2018), 222-236.
7. Hell, Pavol and Miller, D.J,.Graphs with given achromatic number, Discrete Mathematics, 16(1976), 195-207.
8. Thilagavathi, K., Thilagavathy, K.P. and Roopesh, N., The achromatic coloring of graphs, Electronic Notes in Discrete Mathematics, 33(2009), 153-156.

9. Thilagavathi, K. and Roopesh, N., Generalization of achromatic coloring of Central graphs, Electronic Notes in Discrete Mathematics, 33(2009), 147-152.
10. Thilagavathi, K.,Vijayalakshmi, D.and Roopesh, N., b-Colouring of Central Graphs, International Journal of Computer Applications, (2010) volume 3-No.11.
11. Vernold, Vivin J., Venkatachalam, M. and Akbar, Ali M.M., A note on achromatic coloring of Star graph families, Faculty of Sciences and Mathematics, University of Niŝ, Serbia, Filomat 23:3(2009), 251-255.
12. Vivin, J. Vernold, Harmonious Coloring of Total Graphs, n-leaf, Central Graphs and Circumdetic Geraphs, Ph.D Thesis, Bharathiar University, India, 2007.
13. Yannakakis, M. and Gavril, F., Edge dominating sets in graphs, SIAM Journal of Applied Mathematics, 38(1980), 364-372.