Results 11 to 20 of about 873 (268)
Independent resolving sets in graphs [PDF]
AKCE International Journal of Graphs and Combinatorics, 2021 Let be a connected graph. Let be a subset of V with an order imposed on W. The k-vector is called the resolving vector of v with respect to W. The set W is called a resolving set if for any two distinct vertices In this paper we investigate the existence of independent resolving sets in Cartesian product and corona of graphs.
B. Suganya, S. Arumugam 0001
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.
Boris Aronov +2 more
openaire +5 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
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
openaire +1 more source
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. A subset S is said to be resolving set of G if Gamma(u/S) not equal to Gamma(v/S) for all u, v in V-S ...
Sooryanarayana, Badekara +2 more
openaire +1 more source
Determining Sets, Resolving Sets, and the Exchange Property [PDF]
Graphs and Combinatorics, 2009 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
openaire +2 more sources
Resolving-power dominating sets
Applied Mathematics and Computation, 2015 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sudeep Stephen +3 more
openaire +3 more sources
Properties of a Complete Fuzzy Normed Algebra
مجلة بغداد للعلوم, 2019 The aim of this paper is to translate the basic properties of the classical complete normed algebra to the complete fuzzy normed algebra at this end a proof of multiplication fuzzy continuous is given.
Kider et al.
doaj +1 more source
Levenshtein graphs: Resolvability, automorphisms & determining sets
Discrete Mathematics, 2023 22 pages, 3 ...
Perrin E. Ruth, Manuel E. Lladser
openaire +2 more sources
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 χ
Datchev, Kiril, Vasy, András
openaire +2 more sources