Back close

Total coloring of the prismatic graphs

Publication Type : Journal Article

Publisher : Discrete Mathematics, Algorithms and Applications

Source : Discrete Mathematics, Algorithms and Applications, Volume 12, Number 03, p.2050032 (2020)

Url :

Campus : Coimbatore

School : School of Engineering

Department : Mathematics

Year : 2020

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. A graph G is prismatic, if for every triangle T, every vertex not in T has exactly one neighbor in T. In this paper, we prove the total coloring conjecture (TCC) for prismatic graphs and the tight bound of the TCC for some classes of prismatic graphs.

Cite this Research Publication : M. S. and Dr. Somasundaram K., “Total coloring of the prismatic graphs”, Discrete Mathematics, Algorithms and Applications, vol. 12, p. 2050032, 2020.

Admissions Apply Now