Results 21 to 30 of about 8,068,470 (244)
Levenshtein graphs: Resolvability, automorphisms & determining sets
Discrete Mathematics, 2023 22 pages, 3 ...
Perrin E. Ruth, Manuel E. Lladser
openaire +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$.
Héger, Tamás, Takáts, Marcella
openaire +4 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
Breast cancer chemical structures and their partition resolvability
Mathematical Biosciences and Engineering, 2023 Cancer is a disease that causes abnormal cell formation and spreads throughout the body, causing harm to other organs. Breast cancer is the most common kind among many of cancers worldwide.
Qingqun Huang +5 more
doaj +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
Secure Resolving Sets in a Graph [PDF]
Symmetry, 2018 Let G = (V, E) be a simple, finite, and connected graph. A subset S = {u1, u2, …, uk} of V(G) is called a resolving set (locating set) if for any x ∈ V(G), the code of x with respect to S that is denoted by CS (x), which is defined as CS (x) = (d(u1, x), d(u2, x), .., d(uk, x)), is different for different x.
Hemalathaa Subramanian +1 more
openalex +3 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
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
Optimal Fault-Tolerant Resolving Set of Power Paths
Mathematics, 2023 In a simple connected undirected graph G, an ordered set R of vertices is called a resolving set if for every pair of distinct vertices u and v, there is a vertex w∈R such that d(u,w)≠d(v,w).
Laxman Saha +4 more
doaj +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