On achromatic number of central graph of some graphs

No Thumbnail Available

Date

2019-08-01

Journal Title

Journal ISSN

Volume Title

Publisher

Ankara Üniversitesi Fen Fakültesi

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.

Description

Keywords

Achromatic coloring, Achromatic number, Central graph

Citation