Some Graphs with A Given Achromatic Number

Abstract

Achromatic coloring of a graph is a proper vertex coloring in which every distinct pair of color classes is adjacent by at least one edge. The largest number of colors that can be used to color a graph under such coloring is the achromatic number, denoted by . In this paper we try to attach some graphs to a complete graph  so that the achromatic number of the resultant graph is .