Results 11 to 20 of about 147,496 (294)
On classes of neighborhood resolving sets of a graph [PDF]
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 +4 more sources
Maximal resolving sets in a graph [PDF]
International Journal of Mathematics for IndustryLet G be a connected graph. A subset [Formula: see text] of [Formula: see text] is called a resolving set of G if the code of any vertex [Formula: see text] with respect to S is different from the code of any other vertex where code of u with respect to ...
V. Swaminathan, R. Sundareswaran
doaj +3 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 +3 more sources
Properties of Fuzzy Resolving Set [PDF]
Turkish Journal of Computer and Mathematics Education (TURCOMAT), 2021 In a fuzzy graph , for a subset of , the representation of with respect to in terms of strength of connectedness of vertices are distinct then is called the fuzzy resolving set of . In this article, we discuss the properties of fuzzy resolving set and fuzzy resolving number.
et. al., D. Mary Jiny,
openaire +3 more sources
On the Characterization of a Minimal Resolving Set for Power of Paths [PDF]
Mathematics, 2022 For a simple connected graph G=(V,E), an ordered set W⊆V, is called a resolving set of G if for every pair of two distinct vertices u and v, there is an element w in W such that d(u,w)≠d(v,w).
Laxman Saha +4 more
doaj +3 more sources
Resolving sets for Johnson and Kneser graphs [PDF]
European Journal of Combinatorics, 2013 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)$. In this paper, we consider the Johnson graphs $J(n,k)$ and Kneser graphs $K(n,k)$, and obtain various constructions of resolving sets for these graphs. As well as general constructions,
Robert F. Bailey +6 more
openaire +6 more sources
On the Dominant Local Resolving Set of Vertex Amalgamation Graphs [PDF]
Cauchy: Jurnal Matematika Murni dan Aplikasi, 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
doaj +3 more sources
Resolving Sets in Temporal Graphs [PDF]
A \emph{resolving set} $R$ in a graph $G$ is a set of vertices such that every vertex of $G$ is uniquely identified by its distances to the vertices of $R$. Introduced in the 1970s, this concept has been since then extensively studied from both combinatorial and algorithmic points of view. We propose a generalization of the concept of resolving sets to
Jan Bok, Antoine Dailly, Tuomo Lehtilä
core +5 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