Lower bounds for dilation, wirelength, and edge congestion of embedding graphs into hypercubes von Sundara Rajan, R., Kalinowski, Thomas, Klavžar, Sandi, Mokhtar, Hamid, Rajalaxmi, T. M.

Volltext

Wirelength of embedding complete multipartite graphs into certain graphs von R., Sundara Rajan, Rajalaxmi, T.M., Liu, Jia-Bao, Sethuraman, G.

Volltext

Deep quaternion Fourier transform for salient object detection von Revathi, T., Rajalaxmi, T.M., Sundara Rajan, R., Freire, Wilhelm Passarella

Volltext

Biochemical and phylogenetic networks-I: hypertrees and corona products von Rajan, R. Sundara, Kumar, K. Jagadeesh, Shantrinal, A. Arul, Rajalaxmi, T. M., Rajasingh, Indra, Balasubramanian, Krishnan

Volltext

Topological and Thermodynamic Entropy Measures for COVID-19 Pandemic through Graph Theory von Nandini, G. Kirithiga, Rajan, R. Sundara, Shantrinal, A. Arul, Rajalaxmi, T. M., Rajasingh, Indra, Balasubramanian, Krishnan

Volltext

Biochemical and phylogenetic networks-II: X-trees and phylogenetic trees von Rajan, R. Sundara, Shantrinal, A. Arul, Kumar, K. Jagadeesh, Rajalaxmi, T. M., Rajasingh, Indra, Balasubramanian, Krishnan

Volltext

Maximum Subgraph Problem for 3-Regular Knödel graphs and its Wirelength von Rajan, R. Sundara, Reji, Remi Mariam, Rajalaxmi, T. M.

Volltext

An asymptotic relation between the wirelength of an embedding and the Wiener index von K. Jagadeesh Kumar, Sandi Klavzar, R. Sundara Rajan, Indra Rajasingh, T. M. Rajalaxmi

Volltext

A linear time algorithm for embedding chord graphs into certain necklace and windmill graphs von T. M. Rajalaxmi, N. Parthiban, Joe Ryan, A. Arul Shantrinal, R. Sundara Rajan

Volltext

Preface: Proceedings of the International Conference on Recent Advances in Mathematics and Computational Engineering

Volltext

QSPR analysis for certain similar chemical compounds in retinol von Sundar, Surabhi, Rajalaxmi, T. M., Rajan, R. Sundara

Volltext

Resilience measures in christmas trees von Rajan, R. Sundara, Nandini, G. Kirithiga, Rajalaxmi, T. M.

Volltext

Transmission in H-naphtalenic nanosheet von Sharon, Jane Olive, Rajalaxmi, T.M., Klavžar, Sandi, Rajan, R. Sundara, Rajasingh, Indra

Volltext

Transmission in Certain Trees von Sharon, Jane Olive, Rajalaxmi, T.M.

Volltext

An algorithm for embedding Turán graphs into incomplete hypercubes with minimum wirelength von Shantrinal, A. Arul, Klavžar, Sandi, Rajalaxmi, T.M., Rajan, R. Sundara

Volltext

Edge Forcing in Butterfly Networks von Jessy, Sujana G, Rajalaxmi, T M, Rajasingh, Indra, R Sundara Rajan

Volltext

Forcing sets in triangular grid networks von G, Jessy Sujana, Rajalaxmi, T.M.

Volltext

Lower bounds for dilation, wirelength, and edge congestion of embedding graphs into hypercubes von R Sundara Rajan, Kalinowski, Thomas, Klavžar, Sandi, Mokhtar, Hamid, Rajalaxmi, T M

Volltext

A linear time algorithm for embedding hypercube into cylinder and torus von R., Sundara Rajan, Rajasingh, Indra, N., Parthiban, T.M., Rajalaxmi

Volltext

Deep Learning for People Counting Model von Revathi, T., Rajalaxmi, T. M.

Volltext