Kanagasabapathi Somasundaram

collaborators

2 papers

math.CO2026

Adjacent vertex distinguishing total chromatic number of graph products

Amitayu Banerjee, Jayabalan Geetha, Kanagasabapathi Somasundaram

The adjacent vertex distinguishing (AVD)-total chromatic number $χ_{a}^{''} (G)$ of a graph $G$ is the least integer $k$ for which $G$ has a proper total coloring $f$ with $k$ colors s…

math.CO2021

Total Colorings of Some Classes of FourRegular Circulant Graphs

R. Navaneeth, J. Geetha, K. Somasundaram +1

The total chromatic number, $χ^{''} (G)$ is the minimum number of colors which need to be assigned to obtain a total coloring of the graph $G$ . The Total Coloring Conjecture (TCC) made…