Results 31 to 40 of about 8,068,470 (244)
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
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
On classes of neighborhood resolving sets of a graph
Electronic Journal of Graph Theory and Applications, 2018 Let G = (V, E) be a simple connected graph. A subset S of V is called a neighbourhood set of G if G = ⋃s ∈ S < N[s] > , where N[v] denotes the closed neighbourhood of the vertex v in G. Further for each ordered subset S = {s1, s2, ..., sk} of V and
B. Sooryanarayana, Suma A. S.
doaj +1 more source
Benchmarking photon number resolving detectors. [PDF]
Optics Express, 2020 Photon number resolving detectors are the ultimate measurement of quantum optics, which is the reason why developing the technology is getting significant attention in recent years.
Jan Provazn'ik +3 more
semanticscholar +1 more source
Resolvents, integral equations, limit sets [PDF]
Mathematica Bohemica, 2010 Summary: We study a linear integral equation \(x(t)=a(t)-\int ^t_0 C(t,s) x(s)\, \text{d}s\), its resolvent equation \(R(t,s)=C(t,s)-\int ^t_s C(t,u)R(u,s)\,\text{d}u\), the variation of parameters formula \(x(t)=a(t)-\int ^t_0 R(t,s)a(s)\, \text{d}s\) and a perturbed equation.
Burton, T. A., Dwiggins, D. P.
openaire +1 more source
Progress toward resolving the attentional capture debate
Visual Cognition, 2020 For over 25 years, researchers have debated whether physically salient stimuli capture attention in an automatic manner, independent of the observer’s goals, or whether the capture of attention depends on the match between a stimulus and the observer’s ...
S. Luck +4 more
semanticscholar +1 more source
Resolving sets for Johnson and Kneser graphs [PDF]
, 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 +2 more sources
Bounds on the domination number and the metric dimension of co-normal product of graphs
Journal of Inequalities and Applications, 2018 In this paper, we establish bounds on the domination number and the metric dimension of the co-normal product graph GH $G_{H}$ of two simple graphs G and H in terms of parameters associated with G and H.
Imran Javaid +2 more
doaj +1 more source
Error-correcting codes from k-resolving sets
Discussiones Mathematicae Graph Theory, 2019 13 pages, 2 ...
Bailey, Robert F. +1 more
openaire +4 more sources