9 results for "Kamran Azhar"
Showing 1–9 · 1.13 seconds · RSS
-
Journal Article Full text
Fault-tolerant partition resolvability of cycle with chord
In the realm of connected networks, distance-based parameters, particularly the partition dimension of graphs, have extensive applications across various fields, including chemistry and computer science. A notable variant of the partition dimension is the fault-tolerant resolving partition, which…
Also available at: DOAJ
-
Journal Article
On Sharp Bounds of Fault-Tolerant Partition Dimension of Convex Polytopes
Graph theory is a fundamental and powerful tool for designing and modeling networks. It plays a vital role in diverse real-world systems, including social, computer, biological, ecological, and neural networks. Convex polytopes are convex sets of elements contained in the Euclidean space ℝ^n. They…
-
Journal Article
Local Metric and Partition Resolvability of Graphs With Applications
The distance-based graph parameters are being used extensively in the fields of chemistry, computer science, scheduling and in many operations’ management problems. The unique identification of vertices plays a key role in the computation of these parameters. The local versions of these parameters…
-
Journal Article Full text
Fault-Tolerant Metric Dimension in Carbon Networks
In this paper, we study the fault-tolerant metric dimension in graph theory, an important measure against failures in unique vertex identification. The metric dimension of a graph is the smallest number of vertices required to uniquely identify every other vertex based on their distances from these…
-
Journal Article Full text
Local Metric Resolvability of Generalized Petersen Graphs
The local metric basis and local metric generator can play a significant role in deciding optimal locations for many facilities like hospitals, fire stations, medical labs, and grocery stores. The local metric basis generates codes in terms of distance for each node of the graph in such a way that…
-
Journal Article
Fault-Tolerant Partition Resolvability of Cyclic Networks
Graph invariants provide an amazing tool to analyze the abstract structures of networks. The interaction and interconnection between devices, sensors, and service providers have opened the door for an eruption of mobile over the web applications. Structure of web sites containing number of pages…
-
Journal Article
Fault-Tolerant Partition Resolvability in Mesh Related Networks and Applications
Fault-tolerance of a system measures its working capability in the presence of faulty components in the system. The fault-tolerant partition dimension of a network computes the least number of subcomponents of network required to distinctively identify each node in the presence of faults, having…
-
Journal Article Full text
The Application of Fault-Tolerant Partition Resolvability in Cycle-Related Graphs
The concept of metric-related parameters permeates all of graph theory and plays an important role in diverse networks, such as social networks, computer networks, biological networks and neural networks. The graph parameters include an incredible tool for analyzing the abstract structures of…