Agha Kashif
Papers
12
Total Citations
79
H-Index
6
About
Agha Kashif is a mathematician and computer scientist whose research focuses on the intersection of graph theory, network design, and fault tolerance. His primary contributions lie in the development and analysis of metric-related graph invariants, particularly the partition dimension and its fault-tolerant variants. These parameters are critical for applications in sensor networking, robot navigation, pattern recognition, and intelligent systems, as they determine the minimum number of network components needed to uniquely identify nodes, even when some components fail. His most cited work, "On fault-tolerant partition dimension of graphs" (2020, 14 citations), establishes foundational results for this concept, while subsequent papers extend the theory to specific network topologies like circulant graphs, homogeneous caterpillar graphs, mesh-related networks, cyclic networks, and Toeplitz networks. Kashif’s research is notable for its practical orientation, addressing real-world challenges in reliability and efficiency for interconnection networks, web structures, and even chemical and pharmaceutical modeling. With a growing body of work that includes studies on rotationally symmetric graphs and convex polytopes, he is recognized for advancing the theoretical toolkit needed to design robust, scalable networks in an era of pervasive connectivity.
Research Focus
Key Achievements
Top Papers
- 1On fault-tolerant partition dimension of graphs14 citations · 2020
- 2On 2-partition dimension of the circulant graphs12 citations · 2021
- 3On Fault-Tolerant Partition Dimension of Homogeneous Caterpillar Graphs10 citations · 2021
- 4
- 5Fault-Tolerant Partition Resolvability of Cyclic Networks7 citations · 2021
- 6On the Fault Tolerant Partition Resolvability of Toeplitz Networks7 citations · 2022
- 7On 2-metric resolvability in rotationally-symmetric graphs5 citations · 2021
- 8
- 9
- 10Fault Tolerant Partition Resolvability in Convex Polytopes3 citations · 2022