Back close

Some Graphs with a Given Achromatic Number

Publication Type : Journal Article

Publisher : International Journal of Advanced Science and Technology

Source : International Journal of Advanced Science and Technology, Vol. 29, No. 7s, (2020), pp. 5755-5763 ISSN: 2005-4238

Url : http://sersc.org/journals/index.php/IJAST/article/view/26469

Campus : Kochi

School : School of Physical Sciences

Department : Mathematics

Year : 2020

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.

Cite this Research Publication : Hasna Noushad and Manjusha P., "Some Graphs with A Given Achromatic Number," International Journal of Advanced Science and Technology, Vol. 29, No. 7s, (2020), pp. 5755-5763 ISSN: 2005-4238.

Admissions Apply Now