Back close

Achromatic Number of Some Graphs

Publication Type : Journal Article

Publisher : International Journal of Pure and Applied Mathematics.

Source : International Journal of Pure and Applied Mathematics, Volume 118, Number 20, p.941-949 (2018)

Campus : Kochi

School : School of Arts and Sciences

Department : Mathematics

Year : 2018

Abstract : Achromatic colouring is vertex colouring of a graph in such a way that every pair of distinct colours appears on the the endpoints of atleast one edge. The maximum possible number of colours in the complete colouring of the graph is the achromatic number Ψ(G). We discuss the achromatic number of (Tm,n), Sn and D[Tn].

Cite this Research Publication : Aparna K M, Henila Correya, and Manjusha P., “Achromatic Number of Some Graphs”, International Journal of Pure and Applied Mathematics, vol. 118, pp. 941-949, 2018.

Admissions Apply Now