Sundara Rajan R.

About

RESEARCH ACTIVITIES

Major Field : Theoretical Computer Science, Discrete Mathematics
Fine Field : Network Embedding and Cheminformatics
Research Interests : Embedding Parameters in Networks, Fault Tolerance in Networks, Graph Labeling and Colouring, Domination Problem Chemical Graph Theory and Burning number.

Employment

• Rajalakshmi Engineering College Professor
  2025 - Present
• Hindustan Institute of Technology and Science Professor
  2022 - 2025
• Hindustan Institute of Technology & Science Associate Professor
  2016 - 2022
• VIT University - Chennai Campus Assistant Professor
  2014 - 2015
• Tagore Engineering College Assistant Professor
  2012 - 2013
• Loyola College Lecturer
  2008 - 2009

Education

Education history is unavailable.

Projects & Funding

Projects & funding information is unavailable.

Publications (115)

• An Upper Bound for Edge Congestion and the Exact Wirelength of Embedding onto BC Graphs
  International Journal of Foundations of Computer Science 2026 DOI: 10.1142/S0129054125500224
  +Save
• Graph Embedding for Minimum Wirelength in Circulant Networks: Applications in Architecture Simulation and Comparative Analysis
  Journal of Interconnection Networks 2026 DOI: 10.1142/S0219265925500082
  +Save
• Optimizing Maximum Subgraph and Wirelength in WK-Recursive Networks
  International Journal of Foundations of Computer Science 2026 DOI: 10.1142/S0129054126500243
  +Save
• Embedding of 2 p -partite graphs into line graphs of arbitrary and binomial trees
  International Journal of Parallel, Emergent and Distributed Systems 2026 DOI: 10.1080/17445760.2026.2694347
  +Save
• Optimization of layout for embedding complete k-partite graphs into line graphs of certain tree architectures
  Electronic Journal of Graph Theory and Applications 2026 DOI: 10.5614/ejgta.2026.14.1.12
  +Save
• Maximum subgraph and wirelength analysis of extended Sierpiński networks in parallel computing
  Discrete Applied Mathematics 2026 DOI: 10.1016/j.dam.2026.01.013
  +Save
• Maximum subgraph and wirelength optimization in cyclic bipartite networks G k ,3
  International Journal of Parallel, Emergent and Distributed Systems 2026 DOI: 10.1080/17445760.2025.2610814
  +Save
• Embedding of complete bipartite graphs into some special classes of chordal graphs
  Journal of Discrete Mathematical Sciences and Cryptography 2026 DOI: 10.47974/JDMSC-2387
  +Save
• Embedding of extended sierpinski networks S++(k, m) into certain trees
  RAIRO - Operations Research 2025 DOI: 10.1051/ro/2025085
  +Save
• Optimal Layout of (Kp − Cp)n into Wheel-Like Networks
  Journal of Interconnection Networks 2025 DOI: 10.1142/S0219265924500075
  +Save