Results 21 to 30 of about 13,357,344 (331)
A bridge between the minimal doubly resolving set problem in (folded) hypercubes and the coin weighing problem [PDF]
Discrete Applied Mathematics, 2020 In this paper, we consider the minimal doubly resolving set problem in Hamming graphs, hypercubes and folded hypercubes. We prove that the minimal doubly resolving set problem in hypercubes is equivalent to the coin weighing problem.
Changhong Lu, Qing-Jie Ye
semanticscholar +1 more source
Resolving set and exchange property in nanotube
AIMS Mathematics, 2023 Give us a linked graph, $ G = (V, E). $ A vertex $ w\in V $ distinguishes between two components (vertices and edges) $ x, y\in E\cup V $ if $ d_G(w, x)\neq d_G (w, y). $ Let $ W_{1} $ and $ W_{2} $ be two resolving sets and $ W_{1} $ $ \neq $ $ W_{2} $.
Ali N. A. Koam +4 more
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.
Boris Aronov +2 more
openaire +8 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 +5 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
J. Breinholt +23 more
semanticscholar +1 more source
On the Dominant Local Resolving Set of Vertex Amalgamation Graphs [PDF]
, 2023 Basically, the new topic of the dominant local metric dimension which be symbolized by Ddim_l (H) is a combination of two concepts in graph theory, they were called the local metric dimension and dominating set. There are some terms in this topic that is
Reni Umilasari +3 more
core +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
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