Results 61 to 70 of about 15,842 (155)

The Making of Cloud Applications An Empirical Study on Software Development for the Cloud

open access: yes, 2015
Cloud computing is gaining more and more traction as a deployment and provisioning model for software. While a large body of research already covers how to optimally operate a cloud system, we still lack insights into how professional software engineers ...
Barker A.   +6 more
core   +1 more source

Fault tolerance for metric dimension and its variants

open access: yes
Hernando et al. (2008) introduced the fault-tolerant metric dimension $\text{ftdim}(G)$, which is the size of the smallest resolving set $S$ of a graph $G$ such that $S-\left\{s\right\}$ is also a resolving set of $G$ for every $s \in S$. They found an upper bound $\text{ftdim}(G) \le \dim(G) (1+2 \cdot 5^{\dim(G)-1})$, where $\dim(G)$ denotes the ...
Geneson, Jesse, Tsai, Shen-Fu
openaire   +2 more sources

Minimum Fault-Tolerant, local and strong metric dimension of graphs

open access: yes, 2014
In this paper, we consider three similar optimization problems: the fault-tolerant metric dimension problem, the local metric dimension problem and the strong metric dimension problem. These problems have applications in many diverse areas, including network discovery and verification, robot navigation and chemistry, etc.
Salman, Muhammad   +2 more
openaire   +2 more sources

Fault-Tolerant Metric Dimension (FTMD) of M-polynomial of Zigzag Edge Coronoid Fused by Starphene

open access: yes, 2023
Abstract The application of graph invariants serves as a valuable tool for analyzing the complex structures of molecular graphs, attracting researchers across various fields. Graph theory has played a pivotal role in explaining chemical structures and finding practical applications.
Umar Farooq   +3 more
openaire   +1 more source

An efficient way to represent the processors and their connections in omega networks

open access: yesAin Shams Engineering Journal
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   +1 more source

Fault-Tolerant Metric Dimension of $P(n,2)$ with Prism Graph

open access: yes, 2018
9 pages, 2 ...
Ahmad, Z.   +3 more
openaire   +2 more sources

Resolvability in Hypergraphs

open access: yes, 2018
This article emphasizes an extension of the study of metric and par- tition dimension to hypergraphs. We give a sharp lower bounds for the metric and partition dimension of hypergraphs in general and give exact values under specified conditions.eral and ...
Haider, Azeem   +3 more
core  

Computation of the Fault-Tolerant Metric Dimension of Certain Networks

open access: yesMathematical Problems in Engineering, 2022
Humera Bashir   +2 more
openaire   +1 more source

Computing fault-tolerant metric dimension of graphs using their primary subgraphs

open access: yes
The metric dimension of a graph is the cardinality of a minimum resolving set, which is the set of vertices such that the distance representations of every vertex with respect to that set are unique. A fault-tolerant metric basis is a resolving set with a minimum cardinality that continues to resolve the graph even after the removal of any one of its ...
Prabhu, S.   +3 more
openaire   +2 more sources

Fault Tolerant Metric Dimensions of Leafless Cacti Graphs with Application in Supply Chain Management

open access: yes
A resolving set for a simple graph $G$ is a subset of vertex set of $G$ such that it distinguishes all vertices of $G$ using the shortest distance from this subset. This subset is a metric basis if it is the smallest set with this property. A resolving set is a fault tolerant resolving set if the removal of any vertex from the subset still leaves it a ...
Asif, Tauseef   +5 more
openaire   +2 more sources

Home - About - Disclaimer - Privacy