Some Graphs with A Given Achromatic Number

  • Hasna Noushad, Manjusha P

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 .

Published
2020-06-01
How to Cite
Hasna Noushad, Manjusha P. (2020). Some Graphs with A Given Achromatic Number. International Journal of Advanced Science and Technology, 29(7s), 5755-5763. Retrieved from https://sersc.org/journals/index.php/IJAST/article/view/26469