Department of Mathematics Hindustan Institute of Technology & Science, Chennai, Tamil Nadu, 603103, 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+ (...
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,...
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...
Install TARU PUBLICATIONSFaster access from your home screen