Results 21 to 30 of about 8,016,307 (335)
Certain Varieties of Resolving Sets of A Graph [PDF]
Journal of the Indonesian Mathematical Society, 2021 Let G=(V,E) be a simple connected graph. For each ordered subset S={s_1,s_2,...,s_k} of V and a vertex u in V, we associate a vector Gamma(u/S)=(d(u,s_1),d(u,s_2),...,d(u,s_k)) with respect to S, where d(u,v) denote the distance between u and v in G.
B. Sooryanarayana +2 more
semanticscholar +2 more sources
On Fault‐Tolerant Resolving Sets of Some Families of Ladder Networks [PDF]
Complex, 2021 In computer networks, vertices represent hosts or servers, and edges represent as the connecting medium between them. In localization, some special vertices (resolving sets) are selected to locate the position of all vertices in a computer network. If an
Hua Wang +4 more
openalex +2 more sources
Resolving sets for Johnson and Kneser graphs [PDF]
European Journal of Combinatorics, 2012 A set of vertices $S$ in a graph $G$ is a {\em resolving set} for $G$ if, for any two vertices $u,v$, there exists $x\in S$ such that the distances $d(u,x) \neq d(v,x)$.
Alberto Márquez +37 more
core +5 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
Metric dimension of star fan graph [PDF]
Scientific ReportsEvery node in a network is said to be resolved if it can be uniquely identified by a vector of distances to a specific set of nodes. The metric dimension is equivalent to the least possible cardinal number of a resolving set.
S. Prabhu +2 more
doaj +2 more sources
Resolving sets and semi-resolving sets in finite projective planes [PDF]
The Electronic Journal of Combinatorics, 2012 In a graph $\Gamma=(V,E)$ a vertex $v$ is resolved by a vertex-set $S=\{v_1,\ldots,v_n\}$ if its (ordered) distance list with respect to $S$, $(d(v,v_1),\ldots,d(v,v_n))$, is unique. A set $A\subset V$ is resolved by $S$ if all its elements are resolved by $S$. $S$ is a resolving set in $\Gamma$ if it resolves $V$.
Tamás Héger, Marcella Takáts
openalex +6 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
Resolving SINR Queries in a Dynamic Setting [PDF]
SIAM Journal on Computing, 2020 We consider a set of transmitters broadcasting simultaneously on the same frequency under the SINR model. Transmission power may vary from one transmitter to another, and a transmitter's signal strength at a given point is modeled by the transmitter's power divided by some constant power $ $ of the distance it traveled.
Aronov, Boris +2 more
openaire +5 more sources
A target enrichment probe set for resolving the flagellate land plant tree of life
Applications in Plant Sciences, 2021 PREMISE New sequencing technologies facilitate the generation of large‐scale molecular data sets for constructing the plant tree of life. We describe a new probe set for target enrichment sequencing to generate nuclear sequence data to build phylogenetic
Jesse W. Breinholt +23 more
semanticscholar +1 more source