IAD Index of Academic Documents
  • Home Page
  • About
    • About Izmir Academy Association
    • About IAD Index
    • IAD Team
    • IAD Logos and Links
    • Policies
    • Contact
  • Submit A Journal
  • Submit A Conference
  • Submit Paper/Book
    • Submit a Preprint
    • Submit a Book
  • Contact
  • 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

ORIGINAL ARTICLE URL
VIEW PAPER (PDF)

* There may have been changes in the journal, article,conference, book, preprint etc. informations. Therefore, it would be appropriate to follow the information on the official page of the source. The information here is shared for informational purposes. IAD is not responsible for incorrect or missing information.


Index of Academic Documents
İzmir Academy Association
CopyRight © 2023-2025