1. Presidency university academic archive
  2. Faculty research papers
  3. Mathematics Department
Please use this identifier to cite or link to this item: http://localhost:8080/xmlui/handle/123456789/1997
Full metadata record
DC FieldValueLanguage
dc.contributor.authorMohan S
dc.contributor.authorK Somasundaram
dc.date.accessioned2022-05-26T05:23:26Z-
dc.date.available2022-05-26T05:23:26Z-
dc.date.issued2020
dc.identifier.citationDiscrete Mathematics, Algorithms & Applications
dc.identifier.urihttp://localhost:8080/xmlui/handle/123456789/1997-
dc.description.abstractA 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.isoen
dc.publisherWorld Scientific
dc.titleTotal Coloring of the Prismatic Graphs Dicrete Mathematics, Algorithms & Applications
dc.typeArticle
Appears in Collections:Mathematics Department

Files in This Item:
File SizeFormat 
MAT-15.docx13.68 kBMicrosoft Word XMLView/Open
Show simple item record


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.