Sudeep Stephen

Sudeep Stephen is a Lecturer in Mathematics at the School of Arts and Humanities, Faculty of Education and Arts. His research focuses on graph theory, combinatorics, and discrete mathematics with applications to network analysis and interconnection systems. Key areas include zero forcing sets, metric dimensions, power domination, and structural properties of networks such as circulant graphs, butterfly networks, and chemical lattice structures.

His publications emphasize theoretical advancements in graph parameters and their applications in designing efficient interconnection networks. Notable contributions include studies on average distance metrics in vertex-weighted graphs and resolving-power dominating sets in chemical structures. His work bridges abstract graph theory with applied problems in computer science and materials science.

Stephen has authored or co-authored over ten peer-reviewed articles in journals like Discrete Applied Mathematics, Journal of Combinatorial Optimization, and Applied Mathematics and Computation. His research consistently explores combinatorial optimization challenges within structured networks.