Please use this identifier to cite or link to this item: http://localhost:8080/xmlui/handle/123456789/1998
Full metadata record
DC FieldValueLanguage
dc.contributor.authorR Vignesh
dc.contributor.authorS Mohan
dc.contributor.authorJ Geetha
dc.contributor.authorK Somasundaram
dc.date.accessioned2022-05-26T05:23:26Z-
dc.date.available2022-05-26T05:23:26Z-
dc.date.issued2020
dc.identifier.citationJournal of Applied & Engineering Mathematics
dc.identifier.urihttp://localhost:8080/xmlui/handle/123456789/1998-
dc.description.abstractA total coloring of a graph G is a combination of vertex and edge colorings of G. In other words, is an assignment of colors to the elements of the graph G such that no two adjacent elements (vertices and edges) receive a same color. The total chromatic number of a graph G, denoted by χ 00(G), is the minimum number of colors that suffice in a total coloring. Total coloring conjecture (TCC) was proposed independently by Behzad and Vizing that for any graph G, Δ(G) + 1 ≤ χ 00(G) ≤ Δ(G) + 2, where Δ(G) is the maximum degree of G. In this paper, we prove TCC for Core Satellite graph, Cocktail Party graph, Modular product of paths and Shrikhande graph.
dc.format.extent10(3)
dc.language.isoen
dc.publisherTurkic World Mathematical Society
dc.titleTotal Coloring of Core Satellite, Cocktail Party & Modular Product Graphs
dc.typeArticle
Appears in Collections:Mathematics Department

Files in This Item:
File SizeFormat 
MAT-16.docx13.7 kBMicrosoft Word XMLView/Open


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