Results 11 to 20 of about 8,068,470 (244)
Minimum weight resolving sets of grid graphs [PDF]
Discrete Mathematics, Algorithms and Applications, 2016 For a simple graph $G=(V,E)$ and for a pair of vertices $u,v \in V$, we say that a vertex $w \in V$ resolves $u$ and $v$ if the shortest path from $w$ to $u$ is of a different length than the shortest path from $w$ to $v$. A set of vertices ${R \subseteq
Patrick Andersen +2 more
core +5 more sources
Independent resolving sets in graphs [PDF]
AKCE International Journal of Graphs and Combinatorics, 2021 Let be a connected graph. Let be a subset of V with an order imposed on W. The k-vector is called the resolving vector of v with respect to W. The set W is called a resolving set if for any two distinct vertices In this paper we investigate the existence
B. Suganya, S. Arumugam
doaj +2 more sources
Properties of Fuzzy Resolving Set
Turkish Journal of Computer and Mathematics Education (TURCOMAT), 2021 Asbract: In a fuzzy graph G(v, σ, μ), for a subset H of σ, the representation of σ − H with respect to H in terms of strength of connectedness of vertices are distinct then H is called the fuzzy resolving set of G.
D. Mary Jiny
semanticscholar +3 more sources
The Simultaneous Strong Resolving Graph and the Simultaneous Strong Metric Dimension of Graph Families [PDF]
Mathematics, 2020 We consider in this work a new approach to study the simultaneous strong metric dimension of graphs families, while introducing the simultaneous version of the strong resolving graph.
Ismael González Yero
doaj +3 more sources
Maximal resolving sets in a graph
International Journal of Mathematics for IndustryLet G be a connected graph. A subset [Formula: see text] of [Formula: see text] is called a resolving set of G if the code of any vertex [Formula: see text] with respect to S is different from the code of any other vertex where code of u with respect to ...
V. Swaminathan, R. Sundareswaran
doaj +2 more sources
Determining sets, resolving sets, and the exchange property [PDF]
Graphs and Combinatorics, 2008 A subset U of vertices of a graph G is called a determining set if every automorphism of G is uniquely determined by its action on the vertices of U. A subset W is called a resolving set if every vertex in G is uniquely determined by its distances to the vertices of W. Determining (resolving) sets are said to have the exchange property in G if whenever
Debra Boutin
openalex +4 more sources
Complexity, 2020 Let G be a finite, connected graph of order of, at least, 2 with vertex set VG and edge set EG. A set S 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 S.
Jia-Bao Liu, Ali Zafari
doaj +2 more sources
Minimal resolving sets for the hypercube [PDF]
, 2011 For a given undirected graph $G$, an \emph{ordered} subset $S = {s_1,s_2,...,s_k} \subseteq V$ of vertices is a resolving set for the graph if the vertices of the graph are distinguishable by their vector of distances to the vertices in $S$. While a superset of any resolving set is always a resolving set, a proper subset of a resolving set is not ...
Ashwin Ganesan
openalex +3 more sources
All metric bases and fault-tolerant metric dimension for square of grid [PDF]
Opuscula Mathematica, 2022 For a simple connected graph \(G=(V,E)\) and an ordered subset \(W = \{w_1,w_2,\ldots, w_k\}\) of \(V\), the code of a vertex \(v\in V\), denoted by \(\mathrm{code}(v)\), with respect to \(W\) is a \(k\)-tuple \((d(v,w_1),\ldots, d(v, w_k))\), where \(d ...
Laxman Saha +2 more
doaj +1 more source
Resolving the Hubble tension with early dark energy [PDF]
Physical Review D, 2022 Early dark energy (EDE) offers a solution to the so-called Hubble tension. Recently, it was shown that the constraints on EDE using Markov Chain Monte Carlo are affected by prior volume effects.
Laura Herold, Elisa G. M. Ferreira
semanticscholar +1 more source