Article Per Year (5 Year)
p-Index From 2021 - 2026
0.23
P-Index
This Author published in this journals
All Journal Electronic Journal of Graph Theory and Applications (EJGTA)
Kanagasabapathi Somasundaram
Department of Mathematics Amrita School of Engineering Amrita Vishwa Vidyapeetham University Coimbatore, India
Electrical & Electronics Engineering

Published : 1 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 1 Documents
Search

 1 
Total coloring conjecture on certain classes of product graphs Kanagasabapathi Somasundaram; Jayabalan Geetha; Radhakrishnan Vignesh
Electronic Journal of Graph Theory and Applications (EJGTA) Vol 11, No 1 (2023): Electronic Journal of Graph Theory and Applications
Publisher : GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.5614/ejgta.2023.11.1.18

Abstract

A total coloring of a graph G is an assignment of colors to the elements of the graph G such that no adjacent vertices and edges receive the 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. Behzad and Vizing conjectured that for any graph G, Δ(G)+1 ≤ χ″(G)≤Δ(G)+2, where Δ(G) is the maximum degree of G. In this paper, we prove the Behzad and Vizing conjecture for Indu - Bala product graph, Skew and Converse Skew product graph, Cover product graph, Clique cover product graph and Comb product graph.
Co-Authors Jayabalan Geetha Radhakrishnan Vignesh