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.
Birincil Dil | İngilizce |
---|---|
Bölüm | Makaleler |
Yazarlar | |
Yayımlanma Tarihi | 1 Ağustos 2019 |
Gönderilme Tarihi | 5 Şubat 2018 |
Kabul Tarihi | 16 Mayıs 2018 |
Yayımlandığı Sayı | Yıl 2019 Cilt: 68 Sayı: 2 |
Communications Faculty of Sciences University of Ankara Series A1 Mathematics and Statistics.
This work is licensed under a Creative Commons Attribution 4.0 International License.