A Study on Achromatic Coloring Graphs and its Applications

V.Kavitha, R.Govindarajan

Abstract: The achromatic number a (G) of a graph is the greatest number of color in a vertex coloring such that each pair of colors appears on at least one edge. In this paper we give some properties of achromatic coloring for complete graphs and its applications.

Keywords: Achromatic coloring, achromatic number, Lower bound, Upper bound