Department of Mathematics Rajalakshmi Engineering College, Chennai, Tamil Nadu, 602105, India
P. Leo Joshwa, R. Sundara Rajan, D. Ahima Emilet, S. Arulanand
In this paper: The Sierpiński graph S(n, Km), known for its recursive and hierarchical construction, serves as a significant model for multiprocessor interconnection architectures. Its extended variant, denoted S+ (...
Merlin Thomas, V. Jude Annie Cynthia, S. Prabhu, R. Sundara Rajan
In this paper: Given a dominating set S ⊆ V(G) for a graph G, each vertex of the graph is either in S or is adjacent to at least one vertex in S. The set S is a secure dominating set of G if, for each vertex u ∈ V(G...
N. Jothilakshmi, R. Sundara Rajan, Indra Rajasingh, D. Ahima Emilet
In this paper: The ability of one architecture to simulate another is the basis for comparing networks. Embedding is used to analyze these simulations. In architectural simulation, graph embedding is considered one...
G. Aishwarya, R. Sundara Rajan, T. M. Rajalaxmi, D. Ahima Emilet
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...
P. Leo Joshwa, R. Sundara Rajan, T. M. Rajalaxmi, D. Ahima Emilet
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,...
A. Shenbaga Priya, R. Sundara Rajan, Indra Rajasingh, V. Govindan
In this paper: Given a graph denoted by G, a vertex cover refers to a selection S taken from the node set V(G) with the condition that every line in the edge set E(G) contains at least one of its endpoints within S....
V. Kamala Kannan, R. Sundara Rajan, T. M. Rajalaxmi, D. Ahima Emilet
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...
S. Arulanand, R. Sundara Rajan, S. Prabhu, Sudeep Stephen
In this paper: Let G be a network, any node v ϵ V(G)\D is adjacent to atleast one node in D, then the set D is named a dominating set, represented by γ(G). A set D of nodes in a network G is called an independent...
G. Kirithiga Nandini, Sandi Klavžar, T. M. Rajalaxmi, R. Sundara Rajan
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...
Install TARU PUBLICATIONSFaster access from your home screen