- Communications Faculty of Sciences University Ankara Series A1 Mathematics and Statistics
- Volume:68 Issue:2
- On achromatic number of central graph of some graphs
On achromatic number of central graph of some graphs
Authors : N NİTHYADEVİ, D VİJAYALAKSHMİ
Pages : 1265-1272
Doi:10.31801/cfsuasmas.517878
View : 24 | Download : 6
Publication Date : 2019-08-01
Article Type : Research Paper
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 ψinsert ignore into journalissuearticles values(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 ψ[Cinsert ignore into journalissuearticles values(L_{n});], ψ[Cinsert ignore into journalissuearticles values(D₃⁽ⁿ⁾);], ψ[Cinsert ignore into journalissuearticles values(F_{m,n});] and ψ[Cinsert ignore into journalissuearticles values(FL_{n});] respectively.Keywords : Achromatic coloring, achromatic number, central graph