Results 11 to 20 of about 8,016,307 (335)
Maximal resolving sets in a graph
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
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
B. Suganya, S. Arumugam
doaj +2 more sources
Properties of Fuzzy Resolving Set
Turkish Journal of Computer and Mathematics Education (TURCOMAT), 2021 Asbract: In a fuzzy graph G(v, σ, μ), for a subset H of σ, the representation of σ − H with respect to H in terms of strength of connectedness of vertices are distinct then H is called the fuzzy resolving set of G.
D. Mary Jiny
semanticscholar +3 more sources
Topological insights into breast cancer drugs: a QSPR approach using resolving topological indices [PDF]
Frontiers in ChemistryIntroductionBreast cancer, one of the most prevalent malignancies in women begins in the milk ducts or lobules and is divided into invasive and non-invasive variants.
E. Pandeeswari, J. Ravi Sankar
doaj +2 more sources
Non-Isolated Resolving Sets of Corona Graphs with Some Regular Graphs [PDF]
Mathematics, 2022 Let G be a connected, simple, and finite graph. For an ordered set W={w1,w2,…,wk}⊆V(G) and a vertex v of G, the representation of v with respect to W is the k-vector r(v|W)=(dG(v,w1),…,dG(v,wk)).
Wahyuni Abidin +2 more
openalex +2 more sources
Restrained 2-Resolving Sets in the Join, Corona and Lexicographic Product of Two Graphs
European Journal of Pure and Applied Mathematics, 2022 Let G be a connected graph. An ordered set of vertices {v1, ..., vl} is a 2-resolving set for G if, for any distinct vertices u, w ∈ V (G), the lists of distances (dG(u, v1), ..., dG(u, vl)) and (dG(w, v1), ..., dG(w, vl)) differ in at least 2 positions.
Jean Mansanadez Cabaro, Helen M. Rara
openalex +3 more sources
The Simultaneous Strong Resolving Graph and the Simultaneous Strong Metric Dimension of Graph Families [PDF]
Mathematics, 2020 We consider in this work a new approach to study the simultaneous strong metric dimension of graphs families, while introducing the simultaneous version of the strong resolving graph.
Ismael González Yero
doaj +3 more sources
ALGORITHM FOR FINDING DOMINATION RESOLVING NUMBER OF A GRAPH [PDF]
Journal of Mechanics of Continua and Mathematical SciencesA minimum resolving set is a resolving set with the lowest cardinality and its cardinality is a dimension of connected graph , represented by . A dominating set is a set of vertices such that each of is either in or has at least one neighbor in ...
Iqbal M. Batiha +2 more
doaj +2 more sources
On the Minimum Differentially Resolving Set Problem for Diffusion Source Inference in Networks
AAAI Conference on Artificial Intelligence, 2016 In this paper we theoretically study the minimum Differentially Resolving Set (DRS) problem derived from the classical sensor placement optimization problem in network source locating.
Chuan Zhou +5 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, Xiao Hu, Changjun Wang
openalex +3 more sources