We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
ON ACHROMATIC NUMBER OF CENTRAL GRAPH OF SOME GRAPHS.
- Authors
NITHYADEVI, N.; VIJAYALAKSHMI, D.
- 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(Ln)], ψ[C(D3(n))], ψ[C(Fm,n)] and ψ[C(FLn)] respectively.
- Subjects
GRAPH coloring; COMPLETE graphs; DEFINITIONS
- Publication
Communications Series A1 Mathematics & Statistics, 2019, Vol 68, Issue 2, p1265
- ISSN
1303-5991
- Publication type
Article
- DOI
10.31801/cfsuasmas.517878