Total Coloring of the Prismatic Graphs Dicrete Mathematics, Algorithms & Applications

Please use this identifier to cite or link to this item: http://localhost:8080/xmlui/handle/123456789/1997

Full metadata record

DC Field	Value	Language
dc.contributor.author	Mohan S
dc.contributor.author	K Somasundaram
dc.date.accessioned	2022-05-26T05:23:26Z	-
dc.date.available	2022-05-26T05:23:26Z	-
dc.date.issued	2020
dc.identifier.citation	Discrete Mathematics, Algorithms & Applications
dc.identifier.uri	http://localhost:8080/xmlui/handle/123456789/1997	-
dc.description.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 GG is prismatic, if for every triangle TT, every vertex not in TT has exactly one neighbor in TT. 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
dc.language.iso	en
dc.publisher	World Scientific
dc.title	Total Coloring of the Prismatic Graphs Dicrete Mathematics, Algorithms & Applications
dc.type	Article
Appears in Collections:	Mathematics Department

Files in This Item:

File	Size	Format
MAT-15.docx	13.68 kB	Microsoft Word XML	View/Open

DSpace JSPUI