Geetha J. currently serves as Assistant Professor at department of Mathematics, School of Engineering, Coimbatore Campus. Her research interests include Graph Theory and Linear Algebra. Geetha has completed M. Sc and M. Phil in Mathematics.






Publication Type: Journal Article
Year of Publication Publication Type Title
2015 Journal Article Aa Gupta, Geetha, J., and K. Somasundaram, “Total coloring algorithm for graphs”, Applied Mathematical Sciences, vol. 9, pp. 1297-1302, 2015.[Abstract]

A total coloring of a graph is an assignment of colors to all the elements of graph such that no two adjacent or incident elements receive the same color. Behzad and Vizing conjectured that for any graph G the following inequality holds: Δ(G)+1≤X′′(G)≤Δ(G)+2, where Δ(G) is the maximum degree of G. Total coloring algorithm is a NP-hard algorithm. In this paper, we give the total coloring algorithm for any graph and we discuss the complexity of the algorithm. © 2015 Aman Gupta, J. Geetha and K. Somasundaram.

More »»
Faculty Details



Faculty Research Interest:

Faculty Email: