|
Research Highlights :
The research area of Dr. T. Kavaskar are coloring of graphs and the graphs obtained from varies algebraic structures, like rings, posets, groups, etc. He has solved many problems in graph coloring, namely b-coloring, fall coloring, partial Grundy coloring etc. Recently, he (along with his research collaborators) have proved every graph is an induced subgraph of a graph obtained from local ring, which is appeared in Discrete Mathematics.
Recent Publications :
1) T. Kavaskar and Vinothkumar K, Padmakar-Ivan Index of Some families of graphs, accepted for publication in Discrete Mathematics, Algorithms and Applications 2023 (doi.org/10.1142/S1793830923500647).
2) G. Arunkumar, Peter J. Cameron, T. Kavaskar and T. Tamizh Chelvam, Induced subgraphs of zero-divisor graphs, Discrete Mathematics 346 (2023) 113580.
3) T. Kavaskar, Perfectness of G-generalized Join of Graphs, LNCS, 13947, 172-183, 2023.
4) T. Kavaskar, Beck's coloring of finite product of commutative ring with unity, Graphs and Combinatorics. 38 (2022), 1-9.
5) S. Francis Raj and T. Kavaskar, On two conjectures on b-coloring of Product Graphs, Studia Scientiarum Mathematicarum Hungarica, 54 (1) 2017 141-149.
6) R. Balakrishnan, S. Francisraj and T. Kavaskar, b-chromatic number of Cartesian product of some family of graphs, Graphs and Combinatorics, (2014) 30:511–520.
7) R. Balakrishnan, T. Kavaskar, Interpolation Theorem for Partial Grundy coloring, Discrete Mathematics, 313(2013) 949–950.
8) R. Balakrishnan, and T. Kavaskar, b-coloring of Kneser Graphs, Discrete Applied Mathematics, 160 (2012) 9-14.
9) R. Balakrishnan, T. Kavaskar, Color chain of a graph, Graphs and Combinatorics 27 (4): 487-493 (2011).
10) R. Balakrishnan, T. Kavaskar, Fall Coloring of Graphs-I, Discussiones Mathematicae Graph Theory 30, (2010) 47-52.
|
