Dr. T. M. Rajalaxmi obtained her Ph.D. in Mathematics from Anna University, Chennai, in 2013. During her doctoral research, she worked on Fuzzy Hidden Markov Chains and the long-term behavior of cyclic non-homogeneous fuzzy Markov chains, with applications in web technologies. She was awarded the Junior Research Fellowship by Sri Sivasubramaniya Nadar College of Engineering (SSNCE) during her Ph.D. programme. In 2013, she joined the Department of Mathematics at SSNCE as an Assistant Professor, where she served for over thirteen years. Her research interests include Discrete Mathematics, Graph Theory, and Network Embedding. She has published over 50 research articles in reputed international journals, supervised doctoral scholars, and organized several national and international conferences and workshops. In July 2026, she joined the School of Science and Humanities (Mathematics), at Shiv Nadar University, Chennai, as an Assistant Professor, where she continues her teaching and research in graph theory and discrete mathematics.

Work Experience

Experience: 14 yrs

• 2026 – till date, Assistant Professor, School of Science of Humanities (Mathematics), Shiv Nadar University, Chennai
• 2013 – 2026 , Assistant Professor, Department of Mathematics, SSN College of Engineering
• 2012 – 2013 ,Lecturer, Department of Mathematics, Sri Sastha Institute of Engineering and Technology, Chennai

Projects

• Title: Optimizing Underwater Surveillance and Monitoring Systems Through Advanced Graph Embedding and Domination.
• Techniques: Dr. R. Sundara Rajan (PI), Dr. Sanjay  Kumar Pandey (Co-PI), Dr. T.M.  Rajalaxmi (Co-PI), Dr.  Sadagopan N (Co-PI)
• Funding Agency: I-DAPT Hub Foundation, IIT (BHU) Varanasi
• Fund Allocated: 20 lakh
• Project Duration: 2026 – 2027
• Status: Ongoing

Publications

1. Journals – 40, Conference Proceedings – 16

1. P. Leo Joshwa, R. Sundara Rajan, T.M. Rajalaxmi, Maximum subgraph and wirelength analysis of extended Sierpiński networks in parallel computing, Discrete Applied Mathematics, Vol. 383, (2026), 367 – 382.
2. G.Aishwarya, R. Sundara Rajan, T. M. Rajalaxmi, and D. Ahima Emilet, Maximum subgraph problem of hiked hypercube and its linear arrangement, Journal of Discrete Mathematical Sciences & Cryptography, Vol. 29(4), (2026), 1673 – 1684.
3. P.Leo Joshwa, R. Sundara Rajan, T. M. Rajalaxmi, and D. Ahima Emilet, Optimal embedding of extended Sierpiński networks into windmill and necklace graphs, Journal of Discrete Mathematical Sciences & Cryptography, Vol. 29(4), (2026), 1695–1706.
4. P.Leo Joshwa, R. Sundara Rajan and T. M. Rajalaxmi, Maximum subgraph and wirelength optimization in cyclic bipartite networks , International Journal of Parallel, Emergent and Distributed Systems, 1–21, 2026.
5. V.Kamala Kannan, R. Sundara Rajan, T. M. Rajalaxmi, and D. Ahima Emilet, Burning number of triangular-like architectures, Journal of Discrete Mathematical Sciences & Cryptography, Vol. 29 (4), (2026), 1787–1797.
6. R. Sundara Rajan, Rini Dominic D., T.M. Rajalaxmi, Graph embedding for minimum wirelength in circulant networks: Applications in architecture simulation and comparative analysis, Journal of Interconnection Networks, Vol. 26(3), (2026), 2550008.
7. R. Sundara Rajan, Remi Mariam Reji, T. M. Rajalaxmi, An upper bound for edge congestion and the exact wirelength of embedding onto BC graphs, International Journal of Foundations of Computer Science, 2025, DOI: https://doi.org/10.1142/S0129054125500224
8. P.Leo Joshwa, R. Sundara Rajan, T. M. Rajalaxmi, Ismail Naci Cangul, Embedding of extended Sierpinski networks into certain trees, 10.1051/ro/2025085,  RAIRO – Operations Research, June 2025.
9. Rini Dominic D., R. Sundara Rajan, T.M. Rajalaxmi, L. Packiaraj, Optimal Layout of Embedding onto Folded Hypercubes, International Journal of Foundations of Computer Science, Vol. 36 (08), (2025) 1205 – 1225.
10. R. Sundara Rajan, Rini Dominic D., T.M. Rajalaxmi, Graph embedding for minimum wirelength in circulant networks: Applications in architecture simulation and comparative analysis, Journal of Interconnection Networks, Vol. 26 (03), (2026), 2550008.
11. R Dominic, R Sundara Rajan, T.M Rajalaxmi, P Manuel, Optimizing network structures: solving the maximum subgraph problem in grid networks, International Journal of Parallel, Emergent and Distributed Systems, Vol. 40 (5), (2025), 596 – 612.
12. Remi Mariam Reji, R. Sundara Rajan, T. M. Rajalaxmi, Embedding Knodel Graph into Cube-like Architectures: Dilation Optimization and Wirelength Analysis, Journal of Interconnection Networks, Vol. 24 (04), (2024), 2350031.
13. R. Sundara Rajan, T.M. Rajalaxmi, Sudeep Stephen, A. Arul Shantrinal, K. Jagadeesh Kumar, Embedding Wheel-like Networks, Iranian Journal of Mathematical Sciences and Informatics, Vol 18 (2), (2023), 185 – 198.
14. G. Kirithiga Nandini, R. Sundara Rajan, T.M. Rajalaxmi, A. Arul Shantrinal, K.S.K. Sharifah and H. Roslan, Wiener Index via Wirelength of an Embedding, Discrete Mathematics, Algorithms and Applications, Vol. 14 (1), (2022) 1 – 19.
15. G. Kirithiga Nandini, Sandi Klavžar, T.M. Rajalaxmi, R. Sundara Rajan, A note on eccentricity based topological indices of honeycomb, oxide and 2-power interconnection networks, Journal of Discrete Mathematical Sciences & Cryptography, Vol. 26 (1), (2021), 231 – 253.
16. R. Sundara Rajan, A. Arul Shantrinal, T.M. Rajalaxmi, Jianxi Fan, Weibei Fan, Embedding complete multipartite graphs into Cartesian product of paths and cycles, Electronic Journal of Graph Theory and Applications, Vol. 9 (2), (2021), 507 – 525.
17. Jessy Sujana G., T.M. Rajalaxmi, Indra Rajasingh, and R. Sundara Rajan, Edge Forcing in Butterfly Networks, Fundamenta Informaticae, Vol. 182 (1), (2021), 1–15.
18. K. Jagadeesh Kumar, Sandi Klavžar, R. Sundara Rajan, Indra Rajasingh, T.M. Rajalaxmi, An Asymptotic Relation Between the Wirelength of an Embedding and the Wiener Index, Discrete Mathematics Letters, Vol. 7, (2021), 74–78.
19. A. Arul Shantrinal, Sandi Klavžar, T.M. Rajalaxmi, and R. Sundara Rajan, An algorithm for embedding Turán graphs into incomplete hypercubes with minimum wirelength, Journal of Graph Algorithms and Applications, Vol. 25 (1), (2021), 367 – 381.
20. T. Revathi, T.M. Rajalaxmi, R. Sundara Rajan, Wilhelm Passarella Freire, Deep Quaternion Fourier Transform for Salient Object Detection, Journal of Intelligent & Fuzzy Systems, Vol. 40 (6), (2021), 11331 – 11340.
21. T.O. Sharon, T.M. Rajalaxmi, Sandi Klavžar, R. Sundara Rajan, and Indra Rajasingh, Transmission in H-naphtalenic nanosheet, Applied Mathematics and Computation, 406 (2021), 126285.
22. R.Sundara Rajan, K. Jagadeesh Kumar, A. Arul Shantrinal, T. M. Rajalaxmi, Indra Rajasingh, Krishnan Balasubramanian, Biochemical and phylogenetic networks-1: hypertrees and corona products, Journal of Mathematical Chemistry, Vol. 59, (2021), 676 – 698.
23. R. Sundara Rajan, A. Arul Shantrinal, K. Jagadeesh Kumar, T. M. Rajalaxmi, Indra Rajasingh, Krishnan Balasubramanian, Biochemical and phylogenetic networks-II: X-trees and phylogenetic trees, Journal of Mathematical Chemistry, Vol. 59, (2021), 699 – 718.
24. R. Sundara Rajan, Thomas Kalinowski, Sandi Klavzar, Hamid Mokhtar, and T.M. Rajalaxmi, Lower Bounds for Dilation, Wirelength, and Edge Congestion of Embedding Graphs into Hypercubes, The Journal of Supercomputing, Vol. 77, (2021), 4135–4150.
25. G. Kirithiga Nandini, R. Sundara Rajan, A. Arul Shantrinal, T. M. Rajalaxmi, Indra Rajasingh and Krishnan Balasubramanian, Topological and Thermodynamic Entropy Measures for COVID-19 Pandemic through Graph Theory, Symmetry, Vol. 12 (12), (2020), 1 – 27.
26. R. Sundara Rajan, T.M. Rajalaxmi, Jia Bao Liu and G. Sethuraman, Wirelength of Embedding Complete Multipartite Graphs into Certain Graphs, Discrete Applied Mathematics, Vol. 280 (15), (2020), 221 – 236.
27. Jessy Sujana, G and T.M. Rajalaxmi, P3-Forcing in Honeycomb Networks, Journal of Combinatorial Mathematics and Combinatorial Computing, Vol. 112, (2020), 263 – 272.
28. Jane Olive Sharon and T.M. Rajalaxmi, Closeness Centrality in Neural and Interconnection Networks, Journal of Combinatorial Mathematics and Combinatorial Computing, Vol. 112, (2020), 241 – 252.
29. T.M. Rajalaxmi, N. Parthiban, Joe Ryan, A. Arul Shantrinal, R. Sundara Rajan, A Linear Time Algorithm for Embedding Chord Graphs into Certain Necklace and Windmill Graphs, Discrete Mathematics Letters, Vol. 3, (2020), 50 – 56.
30. R. Sundara Rajan, Indra Rajasingh, M. Arockiaraj, T.M. Rajalaxmi and B. Mahavir, Embedding of Hypercubes into Generalized Books, Ars Combinatoria, Vol. 135, (2017) 133 – 151.
31. Indra Rajasingh, R. Sundara Rajan, N. Parthiban and T.M. Rajalaxmi, Bothway Embedding of Circulant Network into Grid, Journal of Discrete Algorithms, Vol. 33, (2015) 2 – 9.
32. R. Sundara Rajan, Indra Rajasingh, Paul Manuel, Mirka Miller and T.M. Rajalaxmi, Maximum Incomplete Recursive Circulants in Graph Embeddings, Discrete Mathematics, Algorithms and Applications, Vol. 7(4), (2015), 1 – 22.
33. R. Sundara Rajan, Indra Rajasingh, N. Parthiban and T.M. Rajalaxmi, A Linear Time Algorithm for Embedding Hypercube into Cylinder and Torus, Theoretical Computer Science, Vol. 542, (2014), 108 – 115.
34. R. Sujatha, & T. M. Rajalaxmi, Hierarchical Fuzzy Hidden Markov Chain for Web Applications, International Journal of Information technology and Decision Making, Vol. 15 (1), (2016), 83 – 118.
35. R.Sujatha and T. M. Rajalaxmi, Computation of Entropy of Most Likelihood State Sequence Obtained from Non Homogeneous Fuzzy Hidden Markov Chain, Chiang Mai Journal Science, Vol. 42(4), (2015),  1019 – 1030.
36. R.Sujatha, T.M. Rajalaxmi, Long-Run Behavior of Intuitionistic Markov Chain, Journal of Combinatorial Mathematics and Combinatorial Computing, Vol. 92, (2015), 289 – 295.
37. R.Sujatha, B. Praba, T. M. Rajalaxmi, Fuzzy Hidden Markov Chain for Web Applications, International Journal of Information technology and Decision Making, Vol. 12 (4), (2013), 813 – 835.
38. R.Sujatha, T.M. Rajalaxmi, Computation of the Entropy of Fuzzy Hidden Markov Chain, Applied Mathematical Sciences, Vol. 6 (100), (2012), 4981 – 4994.
39. R.Sujatha, B. Praba, T.M. Rajalaxmi, Long Term Behavior of Cyclic Non – Homogeneous Fuzzy Markov Chain, International Journal of Contemporary Mathematical Sciences, Vol. 5 (22), (2010), 1077 – 1089.
40. R.Sujatha, B. Praba, T.M. Rajalaxmi, A Study on Long Term Behavior of Web Applications using Fuzzy Markov Model, International Journal of Recent Trends in Engineering, Vol. 2 (1), (2009), 26 – 30.

2. Conference Proceedings

1. Rini Dominic, R. Sundara Rajan, T. M. Rajalaxmi, Optimizing Wirelength in Graph Embedding: Folded Hypercube into Fan and Windmill Networks: A Comparative Study, Applied Computational Mathematics, 65–72, 2025.
2. S. Arulanand, R. Sundara Rajan, T. M. Rajalaxmi, Roman Domination Number for Fractal Cubic Networks, Applied Computational Mathematics, 93–100, 2024.
3. R. Sundara Rajan, Remi Mariam Reji, and T. M. Rajalaxmi, Maximum subgraph problem for 3- regular Knodel graphs and its wirelength, Algorithms and Discrete Applied Mathematics, CALDAM 2023, Lecture Notes in Computer Science, Vol. 13947, (2023) 403–414.
4. S. Surabhi, T.M. Rajalaxmi, R. Sundara Rajan, QSPR analysis for certain similar chemical compounds in Retinol, AIP Proceedings, July 2023.
5. R. Sundara Rajan, Kirithiga Nandini G, Rajalaxmi T.M., Resilience Measures in Christmas trees, AIP Proceedings, July 2023.
6. Jessy Sujana, G, T.M. Rajalaxmi, Forcing sets in triangular grid networks, Procedia Computer Science, Vol. 172, (2020), 159 – 164.
7. Jane Olive Sharon, T. M. Rajalaxmi, Transmission in Certain Trees, Procedia Computer Science, Vol. 172, (2020), 193 – 198.
8. Revathi T., Rajalaxmi T.M., Deep Learning for People Counting Model, Soft Computing for Problem Solving. Advances in Intelligent Systems and Computing, Vol. 1048. Springer, Singapore, 2020.
9. Revathi T., T. M. Rajalaxmi, Keyword-Based Journal Categorization Using Deep Learning, Soft Computing for Problem Solving, Advances in Intelligent Systems and Computing, Vol. 816. Springer, 2019.
10. R. Sundara Rajan, T.M. Rajalaxmi, Joe Ryan and Mirka Miller, Improved Bound for Dilation of an Embedding onto Circulant Networks, Applied Mathematics and Scientific Computing, Springer-Verlag, Vol. 2(62), (2019), 623 – 632.
11. Arul Shantrinal, R. Sundara Rajan, T.M. Rajalaxmi and K. Jagadeesh Kumar, Embeddings between circulant networks and hypertrees, Lecture Notes in Engineering and Computer Science Springer, Vol. 2238, (2018) 85 – 89.
12. T.M. Rajalaxmi and R. Sundara Rajan, Embedding of Hypercube into Extended Rooted Theta Mesh, Procedia Computer Science, Vol. 57, (2015), 670 – 677.
13. R. Sundara Rajan, R. Jayagopal, Indra Rajasingh, T.M. Rajalaxmi and N. Parthiban, Combinatorial Properties of Root-fault Hypertrees, Procedia Computer Science, Vol. 57, (2015), 1096–1103.
14. R. Sundara Rajan, Indra Rajasingh, Paul Manuel, T.M. Rajalaxmi and N. Parthiban, Embedding Circulant Networks into Butterfly and Benes Networks, Lecture Notes in Computer Science, Vol. 8986, (2015) 298 – 306.
15. R.Sundara Rajan, N. Parthiban and T.M. Rajalaxmi, Embedding of Recursive Circulants into Certain Necklace Graphs, Mathematics in Computer Science, Vol. 9(2), (2015) 253 – 263.
16. Paul Manuel, Indra Rajasingh, R. Sundara Rajan,  N. Parthiban and T.M. Rajalaxmi, A Tight Bound for Congestion of an Embedding, Lecture Notes in Computer Science, Vol. 8959, (2015), 229 – 237.

Area of Research

• Network Embedding
• Domination in Graphs
• Graph Burning Problems
• Graph Stress

Links

• https://www.scopus.com/pages/authors/55385775500
• https://dblp.org/pid/133/8640.html