Mobeen Munir

Papers

Total Citations

H-Index

About

Mobeen Munir’s research lies at the intersection of graph theory and applied combinatorics, with a central focus on metric dimension problems—a field critical for optimizing robot navigation, network design, and even coin-weighing puzzles. His work systematically explores how to uniquely identify vertices in complex graph structures using minimal resolving sets and partitions. In his most cited paper, “Sharp bounds for partition dimension of generalized Möbius ladders” (2018, 15 citations), Munir established tight theoretical limits for these ladder-like graphs, providing tools that directly enhance efficiency in location-based algorithms. He extended this line of inquiry in “On the Metric Dimension of Generalized Tensor Product of Interval with Paths and Cycles” (2020, 4 citations), where he determined precise conditions for resolving sets in product graphs—a result with implications for large-scale network analysis. Munir’s contributions are notable for their mathematical rigor and practical relevance; his bounds and characterizations offer clear, actionable insights for researchers in discrete mathematics and computer science. By tackling fundamental graph invariants, he has helped bridge abstract theory and real-world optimization, making his work a valuable reference for students and professionals alike.