Muhammad Rehan Faheem

Papers

Total Citations

H-Index

About

Muhammad Rehan Faheem is a mathematician whose research centers on graph theory, with a particular focus on metric dimension and fault-tolerant resolvability in complex networks. His work bridges theoretical graph invariants and practical applications, including robot navigation, computer network optimization, and chemical structure analysis. Faheem’s most cited paper, “Fault‐Tolerant Resolvability in Some Classes of Subdivision Graphs” (2022, 6 citations), explores how resolving sets can serve as sensors in indoor positioning systems to locate interruptions, a concept with direct relevance to machine learning terminologies. By investigating subdivision graphs, he advances the understanding of how graph structures maintain navigational accuracy even when components fail, contributing to more resilient network designs. His research has implications for improving the reliability of positioning technologies and chemical informatics. Faheem’s work is notable for its interdisciplinary reach, connecting abstract graph invariants to real-world challenges in robotics and computer science. With a growing citation record, he is establishing himself as a contributor to the field of applied graph theory, particularly in fault-tolerant systems.