Zafar Hussain

Papers

Total Citations

H-Index

About

Zafar Hussain is a mathematician whose research lies at the intersection of graph theory and metric dimension, with a particular focus on resolving partitions and resolving sets—concepts that have profound applications in robot navigation, network optimization, and combinatorial games. His work is distinguished by its rigorous approach to computing exact values of the partition dimension for complex graph families, a problem known to be computationally challenging. Hussain’s most cited paper, "Sharp bounds for partition dimension of generalized Möbius ladders" (2018, 15 citations), provides precise theoretical bounds for these intricate structures, offering a foundational contribution to the field. This work not only advances the mathematical understanding of graphic metric spaces but also provides practical tools for optimizing location and tracking problems in networks. Through his careful analysis of minimal resolving partitions, Hussain has established himself as a key contributor to the study of metric dimension, bridging abstract graph theory with real-world applications in robotics and optimization.