3 papers
math.CO2026
Dominated Coloring of Some Classes of Perfect and Unicyclic Graphs
Sneha R, J. Geetha, K. Somasundaram
The dominated coloring of a graph is a proper vertex coloring such that each color class is dominated by a vertex. The minimum number of colors required for a dominated colorin…
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 of a graph is the least integer for which has a proper total coloring with colors s…
math.CO2021
Total Colorings of Some Classes of FourRegular Circulant Graphs
R. Navaneeth, J. Geetha, K. Somasundaram +1
The total chromatic number, is the minimum number of colors which need to be assigned to obtain a total coloring of the graph . The Total Coloring Conjecture (TCC) made…