TARU PUBLICATIONS
Author

T. M. Rajalaxmi

Department of Mathematics Sri Sivasubramaniya Nadar College of Engineering, Chennai, Tamil Nadu, 603110, India

Published papers
6
Citations
0
Views
471
Downloads
57

Publications

6 papers
Open Access Research Article·pp. 1673–1684·Vol. 29, Issue 4Apr 2026

Maximum subgraph problem of hiked hypercube and its linear arrangement

G. Aishwarya, R. Sundara Rajan, T. M. Rajalaxmi, D. Ahima Emilet

Published Online: 08 Apr 2026DOI: 10.47974/JDMSC-2389

In this paper: Among interconnection topologies, the hypercube is both popular and highly attractive, extensively used in parallel computing and network design due to its versatility and scalability. Its desirable p...

AbstractReferencesFull Text PDF (875 KB)Views: 95Downloads: 11Citations: 0
Open Access Research Article·pp. 1695–1706·Vol. 29, Issue 4Apr 2026

Optimal embedding of extended Sierpiński networks into windmill and necklace graphs

P. Leo Joshwa, R. Sundara Rajan, T. M. Rajalaxmi, D. Ahima Emilet

Published Online: 08 Apr 2026DOI: 10.47974/JDMSC-2394

In this paper: The Sierpińki network S(p, q) is a hierarchical, self-similar structure with broad applications in multiprocessor interconnection and VLSI design. In this work, we study its enhanced variant, S++ (p,...

AbstractReferencesFull Text PDF (489 KB)Views: 64Downloads: 6Citations: 0
Open Access Research Article·pp. 1777–1786·Vol. 29, Issue 4Apr 2026

Edge forcing in tree-like architectures

G. Jessy Sujana, J. Anitha, T. M. Rajalaxmi

Published Online: 08 Apr 2026DOI: 10.47974/JDMSC-2573

In this paper: To create independent edges in a graph G, this work presents a variant of the zero forcing set called the ‘edge-forcing set.’ A collection of vertices in G that can influence their neighbors to force...

AbstractReferencesFull Text PDF (453 KB)Views: 55Downloads: 13Citations: 0
Open Access Research Article·pp. 1787–1797·Vol. 29, Issue 4Apr 2026

Burning number of triangular-like architectures

V. Kamala Kannan, R. Sundara Rajan, T. M. Rajalaxmi, D. Ahima Emilet

Published Online: 08 Apr 2026DOI: 10.47974/JDMSC-2575

In this paper: The study of graph burning is a crucial area in graph theory, providing insight into the spread of influence, information, or fire across networks. This paper investigates the burning number of triang...

AbstractReferencesFull Text PDF (926 KB)Views: 48Downloads: 9Citations: 0
Open Access Research Article·pp. 1883–1893·Vol. 29, Issue 4Apr 2026

Wiener index of C6C4 mesh topology

T. M. Rajalaxmi, P. B. Sailusha, Maahirah Samiullah, R. Arputhaselvi, C. Jenisha Christy

Published Online: 08 Apr 2026DOI: 10.47974/JDMSC-2572

In this paper: In graph theory, there are many quantitative values that are usually graph invariant and one such invariant that characterizes the structure or topology of a graph is called as topological index. Wien...

AbstractReferencesFull Text PDF (605 KB)Views: 52Downloads: 9Citations: 0
Open Access Research Article·pp. 231–253·Vol. 26, Issue 1Feb 2021

A note on eccentricity based topological indices of honeycomb, oxide and 2-power interconnection networks

G. Kirithiga Nandini, Sandi Klavžar, T. M. Rajalaxmi, R. Sundara Rajan

Published Online: 15 Nov 2021DOI: 10.1080/09720529.2021.1935095

In this paper: In a series of papers, Imran et al. reported the total eccentricity index, the average eccentricity index, the eccentricity-based Zagreb indices, the atom-bond connectivity index, and the geometric ar...

AbstractReferencesFull Text PDF (497 KB)Views: 157Downloads: 9Citations: 0