Results 11 to 20 of about 23,496 (231)
On Minimal Doubly Resolving Sets of Circulant Graphs [PDF]
Acta Mechanica Slovaca, 2017 Consider a simple connected undirected graph G = (VG ,EG), where VG represents the vertex set and EG represents the edge set respectively. A subset B of VG is called a resolving set if for every two distinct vertices x, y of G there is a vertex v in set B such that d(x,v) ≠ d(y,v).
Ali Ahmad, Saba Sultan
openaire +2 more sources
Minimal doubly resolving sets and the strong metric dimension of Hamming graphs
Applicable Analysis and Discrete Mathematics, 2012 We consider the problem of determining the cardinality ?(H2,k) of minimal doubly resolving sets of Hamming graphs H2,k. We prove that for k ? 6 every minimal resolving set of H2,k is also a doubly resolving set, and, consequently, ?(H2,k) is equal to the metric dimension of H2,k, which is known from the literature.
Jozef Kratica +3 more
openaire +4 more sources
Minimal Doubly Resolving Sets of Certain Families of Toeplitz Graph
Computer Modeling in Engineering & Sciences, 2023 Muhammad Ahmad +3 more
openaire +2 more sources
Some algebraic properties of a class of integral graphs determined by their spectrum
, 2021 Let $\Gamma=(V,E)$ be a graph. If all the eigenvalues of the adjacency matrix of the graph $\Gamma$ are integers, then we say that $\Gamma$ is an integral graph.
Liu, Jia-Bao +2 more
core +1 more source
On the Characterization of a Minimal Resolving Set for Power of Paths
Mathematics, 2022 For a simple connected graph G=(V,E), an ordered set W⊆V, is called a resolving set of G if for every pair of two distinct vertices u and v, there is an element w in W such that d(u,w)≠d(v,w).
L. Saha +4 more
semanticscholar +1 more source
Observer Placement for Source Localization: The Effect of Budgets and Transmission Variance [PDF]
, 2016 When an epidemic spreads in a network, a key question is where was its source, i.e., the node that started the epidemic. If we know the time at which various nodes were infected, we can attempt to use this information in order to identify the source ...
Celis, L. Elisa +2 more
core +2 more sources
On minimal doubly resolving sets in graphs
, 2021 Two vertices u,v of connected graph G are doubly resolved by x,y\in V(G)if d(v; x)-d(u; x)\neq d(v; y)-d(u; y): A set W of vertices of the graph G is a doubly resolving set for G if every two distinct vertices of G are doubly resolved by some two vertices of W. (G) is the minimum cardinality of a doubly resolving set for the graph G.
openaire +2 more sources
Approximability of the Minimum Weighted Doubly Resolving Set Problem [PDF]
International Computing and Combinatorics Conference, 2014 Locating source of diffusion in networks is crucial for controlling and preventing epidemic risks. It has been studied under various probabilistic models.
Xujin Chen, Changjun Wang
semanticscholar +1 more source
New results on metric-locating-dominating sets of graphs [PDF]
, 2016 A dominating set S of a graph is a metric-locating-dominating set if each vertex of the graph is uniquely distinguished by its distanc es from the elements of S , and the minimum cardinality of such a set is called the metri c-location- domination number.
González, Antonio +2 more
core +3 more sources
Approximating Optimal Bounds in Prompt-LTL Realizability in Doubly-exponential Time [PDF]
, 2015 We consider the optimization variant of the realizability problem for Prompt Linear Temporal Logic, an extension of Linear Temporal Logic (LTL) by the prompt eventually operator whose scope is bounded by some parameter.
Tentrup, Leander +2 more
core +3 more sources