Indra Rajasingh

Papers

Total Citations

H-Index

About

Indra Rajasingh is a distinguished mathematician and computer scientist whose research lies at the intersection of graph theory, network design, and interconnection architectures. Her most influential work includes the highly cited 2006 paper "An efficient representation of Benes networks and its applications" (91 citations), which introduced novel methods for modeling and analyzing these critical communication networks. Rajasingh has made significant contributions to the study of binary tree-derived architectures, particularly in the area of metric dimension and locating sets in graphs. Her work on landmarks in binary tree architectures explores how to uniquely identify vertices using distance-based coordinates, a fundamental problem with applications in network routing, robot navigation, and sensor networks. She has investigated the metric dimension of various graph families, establishing theoretical foundations for determining minimum locating sets. Her research has advanced understanding of how to efficiently represent and navigate complex network topologies. With over 90 citations on her seminal work alone, Rajasingh's contributions continue to influence researchers working on network theory, graph algorithms, and the design of efficient interconnection networks for parallel computing systems.