Publication Type:

Journal Article

Source:

Electronic Notes in Discrete Mathematics, Volume 53, p.173 - 180 (2016)

URL:

//www.sciencedirect.com/science/article/pii/S1571065316300701

Keywords:

Complete graphs

Abstract:

Abstract A total coloring of a graph is an assignment of colors to all the elements of the graph such that no two adjacent or incident elements receive the same color. In this paper, we prove the tight bound of Behzad and Vizing conjecture on total coloring for Compound graph of G and H, where G and H are any graphs.

Cite this Research Publication

S. Mohan, Geetha, J., and Dr. Somasundaram K., “Total Coloring of Certain Classes of Product Graphs”, Electronic Notes in Discrete Mathematics, vol. 53, pp. 173 - 180, 2016.

207
PROGRAMS
OFFERED
6
AMRITA
CAMPUSES
15
CONSTITUENT
SCHOOLS
A
GRADE BY
NAAC, MHRD
8th
RANK(INDIA):
NIRF 2018
150+
INTERNATIONAL
PARTNERS