We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
TOTAL COLORINGS OF CORE-SATELLITE, COCKTAIL PARTY AND MODULAR PRODUCT GRAPHS.
- Authors
VIGNESH, R.; MOHAN, S.; GEETHA, J.; SOMASUNDARAM, K.
- Abstract
A 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 χ'(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 ≤ χ'(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.
- Subjects
COCKTAIL parties; GRAPH coloring; COLORS
- Publication
TWMS Journal of Applied & Engineering Mathematics, 2020, Vol 10, Issue 3, p778
- ISSN
2146-1147
- Publication type
Article