Sohail Zafar

About

Sohail Zafar is a prominent researcher in graph theory and network science, whose work centers on metric-related graph invariants—particularly partition dimension, fault-tolerant resolvability, and fractional metric dimensions. His major contributions lie in developing robust mathematical frameworks to analyze the structure and reliability of complex networks, including circulant graphs, homogeneous caterpillars, mesh-related networks, cyclic networks, Toeplitz networks, and rotationally symmetric planar networks. By introducing and refining concepts such as fault-tolerant partition resolvability and 2-metric resolvability, Zafar has provided powerful tools for applications in sensor networking, robot navigation, intelligent systems, pattern recognition, image processing, and chemical structure analysis. His most cited paper, “On fault-tolerant partition dimension of graphs” (2020), has garnered 14 citations, while his subsequent works on partition dimensions of circulant graphs and homogeneous caterpillars have each received over 10 citations. Zafar’s research consistently emphasizes practical fault tolerance—ensuring networks can uniquely identify nodes even when components fail—making his work highly relevant for designing reliable interconnection networks and intelligent systems. His studies on Toeplitz networks further highlight their advantages in symmetry, connectivity, and routing efficiency.

Research Focus

Key Achievements

Top Papers

1. 1
   On fault-tolerant partition dimension of graphs

   14 citations · 2020
2. 2
   On 2-partition dimension of the circulant graphs

   12 citations · 2021
3. 3
   On Fault-Tolerant Partition Dimension of Homogeneous Caterpillar Graphs

   10 citations · 2021
4. 4
   Fault-Tolerant Partition Resolvability in Mesh Related Networks and Applications

   9 citations · 2022
5. 5
   Fault-Tolerant Partition Resolvability of Cyclic Networks

   7 citations · 2021
6. 6
   On the Fault Tolerant Partition Resolvability of Toeplitz Networks

   7 citations · 2022
7. 7
   On 2-metric resolvability in rotationally-symmetric graphs

   5 citations · 2021
8. 8
   The Application of Fault-Tolerant Partition Resolvability in Cycle-Related Graphs

   4 citations · 2022
9. 9
   Local Fractional Strong Metric Dimension of Certain Rotationally Symmetric Planer Networks

   4 citations · 2021
10. 10
    Edge Metric Dimension of Some Classes of Toeplitz Networks

    4 citations · 2021

Key Collaborators

Contact & Links