About the Project
We are investigating some sharp bounds on total domination number, inverse total domination number of graph products like Cartesian product, Modular product, Zig-zag product, Strong product, Wreath product and Tensor product. The results we obtain find applications in the area of Communication Network, Internet of Things etc.
Department & Campus
Department of Mathematics, Coimbatore
Any Specific Skillsets Required by Applicants
Basics ideas of Graph Theory, Python Coding, Algorithms, SAGE software
