TY - JOUR
AU - Hasna Noushad, Manjusha P,
PY - 2020/06/01
Y2 - 2024/08/05
TI - Some Graphs with A Given Achromatic Number
JF - International Journal of Advanced Science and Technology
JA - IJAST
VL - 29
IS - 7s
SE - Articles
DO -
UR - http://sersc.org/journals/index.php/IJAST/article/view/26469
SP - 5755-5763
AB - 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 .
ER -