@article{Hasna Noushad, Manjusha P_2020, title={Some Graphs with A Given Achromatic Number}, volume={29}, url={https://sersc.org/journals/index.php/IJAST/article/view/26469}, abstractNote={<p>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 .</p>}, number={7s}, journal={International Journal of Advanced Science and Technology}, author={Hasna Noushad, Manjusha P}, year={2020}, month={Jun.}, pages={5755-5763} }