Results 31 to 40 of about 1,645 (243)
Computation of Edge Resolvability of Benzenoid Tripod Structure
In chemistry, graphs are commonly used to show the structure of chemical compounds, with nodes and edges representing the atom and bond types, respectively.
Ali Ahmad +4 more
doaj +2 more sources
Fault-Tolerant Metric Dimension of Barycentric Subdivision of Cayley Graphs
Metric dimension and fault-tolerant metric dimension of any graph G is subject to size of resolving set. It has become more important in modern GPS and sensors based world as resolving set ensures that in case of semi outage system is still scalable using redundant interfaces.
Ahmad, Ali +2 more
openaire +2 more sources
Edge-Version of Fault-Tolerant Resolvability in Networks
Fault tolerance refers to a system’s capacity to continue functioning as intended, even when one of its components fails. Such a system is known as a fault-tolerant, self-stable system.
Muhammad Faheem +4 more
doaj +2 more sources
Graph invariants are valuable tools for exploring the complex structures of molecular graphs, which have attracted significant interest from researchers across multiple disciplines.
Umar Farooq +5 more
semanticscholar +2 more sources
An efficient way to represent the processors and their connections in omega networks
The understanding of the structure of a network can be enhanced efficiently with distance-reliant parameters. The metric dimension is one such parameter with numerous variations and a rich source of literature.
Savari Prabhu +2 more
doaj +2 more sources
Metric and geometric spanners that are resilient to degree-bounded edge faults
Let $H$ be an edge-weighted graph, and let $G$ be a subgraph of $H$. We say that $G$ is an $f$-fault-tolerant $t$-spanner for $H$, if the following is true for any subset $F$ of at most $f$ edges of $G$: For any two vertices $p$ and $q$, the shortest ...
Ahmad Biniaz +3 more
doaj +4 more sources
Bounds for metric dimension and defensive $k$-alliance of graphs under deleted lexicographic product [PDF]
Metric dimension and defensive $k$-alliance number are two distance-based graph invariants which have applications in robot navigation, quantitative analysis of secondary RNA structures, national defense and fault-tolerant computing.
Kinkar Chandra Das, Mostafa Tavakoli
doaj +1 more source
Optimal Fault-Tolerant Resolving Set of Power Paths
In a simple connected undirected graph G, an ordered set R of vertices is called a resolving set if for every pair of distinct vertices u and v, there is a vertex w∈R such that d(u,w)≠d(v,w).
Laxman Saha +4 more
doaj +1 more source
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 ...
Kamran Azhar +4 more
doaj +1 more source
Fault-Tolerant Metric Dimension of Wheel related Graphs
Concept of resolving set and metric basis has enjoyed a lot of success because of multipurpose applications both in computer and mathematical sciences.
Munir, Mobeen +4 more
core +2 more sources

