Zaffar Iqbal
Papers
1
Total Citations
15
H-Index
1
About
Zaffar Iqbal is a mathematician whose research centers on metric graph theory, combinatorial optimization, and the structural analysis of networks. His work is particularly focused on resolving parameters in graphs, including partition dimension and metric dimension—concepts essential for applications in robot navigation, network design, and coin weighing problems. Iqbal’s most cited paper, “Sharp bounds for partition dimension of generalized Möbius ladders” (2018, 15 citations), provides exact bounds for the partition dimension of these intricate graph families, advancing the theoretical understanding of how to uniquely identify vertices using minimal partitions. This contribution is notable for its precision and practical relevance to optimization and location problems in graph-based systems. Through his research, Iqbal has helped bridge abstract graph theory with real-world applications in networking and algorithmic design, making his work valuable for students and researchers exploring graph invariants and their computational implications.
Research Focus
Key Achievements
Top Papers
- 1Sharp bounds for partition dimension of generalized Möbius ladders15 citations · 2018