T. M. Rajalaxmi

According to our database, T. M. Rajalaxmi authored at least 22 papers between 2013 and 2023.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2023

Maximum Subgraph Problem for 3-Regular Knödel graphs and its Wirelength.

R. Sundara Rajan, Remi Mariam Reji, T. M. Rajalaxmi

Proceedings of the Algorithms and Discrete Applied Mathematics, 2023

2022

Wiener index via wirelength of an embedding.

G. Kirithiga Nandini, R. Sundara Rajan, T. M. Rajalaxmi, A. Arul Shantrinal, Sharifah Kartini Said Husain, Roslan Hasni

Discret. Math. Algorithms Appl., 2022

Embedding into Special Classes of Cyclic Graphs and its Applications in VLSI Layout.

R. Sundara Rajan, Rini Dominic D., T. M. Rajalaxmi, L. Packiaraj

CoRR, 2022

2021

Lower bounds for dilation, wirelength, and edge congestion of embedding graphs into hypercubes.

R. Sundara Rajan, Thomas Kalinowski, Sandi Klavzar, Hamid Mokhtar, T. M. Rajalaxmi

J. Supercomput., 2021

Deep quaternion Fourier transform for salient object detection.

T. Revathi, T. M. Rajalaxmi, R. Sundara Rajan, Wilhelm Passarella Freire

J. Intell. Fuzzy Syst., 2021

An algorithm for embedding Turán graphs into incomplete hypercubes with minimum wirelength.

A. Arul Shantrinal, Sandi Klavzar, T. M. Rajalaxmi, R. Sundara Rajan

J. Graph Algorithms Appl., 2021

Edge Forcing in Butterfly Networks.

G. Jessy Sujana, T. M. Rajalaxmi, Indra Rajasingh, R. Sundara Rajan

Fundam. Informaticae, 2021

Embedding complete multi-partite graphs into Cartesian product of paths and cycles.

R. Sundara Rajan, A. Arul Shantrinal, T. M. Rajalaxmi, Jianxi Fan, Weibei Fan

Electron. J. Graph Theory Appl., 2021

Transmission in H-naphtalenic nanosheet.

Jane Olive Sharon, T. M. Rajalaxmi, Sandi Klavzar, R. Sundara Rajan, Indra Rajasingh

Appl. Math. Comput., 2021

2020

Topological and Thermodynamic Entropy Measures for COVID-19 Pandemic through Graph Theory.

G. Kirithiga Nandini, R. Sundara Rajan, A. Arul Shantrinal, T. M. Rajalaxmi, Indra Rajasingh, Krishnan Balasubramanian

Symmetry, 2020

Wirelength of embedding complete multipartite graphs into certain graphs.

R. Sundara Rajan, T. M. Rajalaxmi, Jia-Bao Liu, G. Sethuraman

Discret. Appl. Math., 2020

2018

Deep Learning for People Counting Model.

T. Revathi, T. M. Rajalaxmi

Proceedings of the Soft Computing for Problem Solving, 2018

2017

Embedding of Hypercubes into Generalized Books.

R. Sundara Rajan, Indra Rajasingh, Micheal Arockiaraj, T. M. Rajalaxmi, B. Mahavir

Ars Comb., 2017

Keyword-Based Journal Categorization Using Deep Learning.

T. Revathi, T. M. Rajalaxmi

Proceedings of the Soft Computing for Problem Solving, 2017

2016

Hierarchical Fuzzy Hidden Markov Chain for Web Applications.

Sujatha Ramalingam, T. M. Rajalaxmi

Int. J. Inf. Technol. Decis. Mak., 2016

2015

Embedding of Recursive Circulants into Certain Necklace Graphs.

R. Sundara Rajan, N. Parthiban, T. M. Rajalaxmi

Math. Comput. Sci., 2015

Bothway embedding of circulant network into grid.

Indra Rajasingh, R. Sundara Rajan, N. Parthiban, T. M. Rajalaxmi

J. Discrete Algorithms, 2015

Maximum incomplete recursive circulants in graph embeddings.

R. Sundara Rajan, Indra Rajasingh, Paul D. Manuel, Mirka Miller, T. M. Rajalaxmi

Discret. Math. Algorithms Appl., 2015

A Tight Bound for Congestion of an Embedding.

Paul D. Manuel, Indra Rajasingh, R. Sundara Rajan, N. Parthiban, T. M. Rajalaxmi

Proceedings of the Algorithms and Discrete Applied Mathematics, 2015

2014

A linear time algorithm for embedding hypercube into cylinder and torus.

R. Sundara Rajan, Indra Rajasingh, N. Parthiban, T. M. Rajalaxmi

Theor. Comput. Sci., 2014

Embedding Circulant Networks into Butterfly and Benes Networks.

R. Sundara Rajan, Indra Rajasingh, Paul D. Manuel, T. M. Rajalaxmi, N. Parthiban

Proceedings of the Combinatorial Algorithms - 25th International Workshop, 2014

2013

Fuzzy Hidden Markov Chain for Web Applications.

Sujatha Ramalingam, T. M. Rajalaxmi, B. Praba

Int. J. Inf. Technol. Decis. Mak., 2013