5 citations · 12 across the 7 of their papers we have counts for
8 papers
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…
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…
Every Elementary Graph is Chromatic Choosable
Nandana K Vasudevan, K Somasundaram, J Geetha
Elementary graphs are graphs whose edges can be colored using two colors in such a way that the edges in any induced get distinct colors. They constitute a subclass of the cl…
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…
Total, Equitable Total and Neighborhood sum distinguishing Total Colorings of Some Classes of Circulant Graphs
S. Prajnanaswaroopa, J. Geetha, K. Somasundaram
In this paper, we have obtained the total chromatic as well as equitable and neighborhood sum distinguishing total chromatic numbers of some classes of the circulant graphs.
Total Coloring for some classes of Cayley graphs
Prajnanaswaroopa S, Geetha J, Somasundaram K
The Total coloring conjecture states that any simple graph G with maximum degree D can be totally colored with at most D+2 colors. In this paper, we have obtained the total chromat…
Total Coloring of some classes of Powers of Cycles
Prajnanaswaroopa S, J Geetha, K Somasundaram +2
In this paper, we have obtained the total chromatic number of some classes of Cayley graphs, odd graphs and mock threshold graphs.
Total Colourings - A survey
Geetha Jayabalan, Narayanan N, K Somasundaram
The smallest integer needed for the assignment of colors to the elements so that the coloring is proper (vertices and edges) is called the total chromatic number of a graph. Vi…