Results 21 to 30 of about 8,830,736 (317)
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$.
Héger, Tamás, Takáts, Marcella
openaire +4 more sources
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
Fault-Tolerant Metric Dimension of Circulant Graphs
Mathematics, 2022 Let G be a connected graph with vertex set V(G) and d(u,v) be the distance between the vertices u and v. A set of vertices S={s1,s2,…,sk}⊂V(G) is called a resolving set for G if, for any two distinct vertices u,v∈V(G), there is a vertex si∈S such that d ...
Laxman Saha +4 more
doaj +1 more source
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
Unicyclic graphs with non-isolated resolving number $2$ [PDF]
Transactions on Combinatorics, 2023 Let $G$ be a connected graph and $W=\{w_1, w_2,\ldots,w_k\}$ be an ordered subset of vertices of $G$. For any vertex $v$ of $G$, the ordered $k$-vector $$r(v|W)=(d(v,w_1), d(v,w_2),\ldots,d(v,w_k))$$ is called the metric representation of $v$ with ...
Mohsen Jannesari
doaj +1 more source
Semiclassical resolvent estimates at trapped sets [PDF]
Annales de l'Institut Fourier, 2012 We extend our recent results on propagation of semiclassical resolvent estimates through trapped sets when a priori polynomial resolvent bounds hold. Previously we obtained non-trapping estimates in trapping situations when the resolvent was sandwiched between cutoffs χ microlocally supported away from the trapping: ∥χR h (E+i0)χ∥=𝒪(h -1 ), a ...
Datchev, Kiril, Vasy, András
openaire +2 more sources
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
The dominant metric dimension of graphs
Heliyon, 2020 The G be a connected graph with vertex set V(G) and edge set E(G). A subset S⊆V(G) is called a dominating set of G if for every vertex x in V(G)∖S, there exists at least one vertex u in S such that x is adjacent to u.
Liliek Susilowati +4 more
doaj +1 more source
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
Resolving the Optimal Metric Distortion Conjecture [PDF]
IEEE Annual Symposium on Foundations of Computer Science, 2020 We study the following metric distortion problem: there are two finite sets of points, V and C, that lie in the same metric space, and our goal is to choose a point in C whose total distance from the points in V is as small as possible.
Vasilis Gkatzelis +2 more
semanticscholar +1 more source