Results 1 to 10 of about 855,405 (264)
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
Double edge resolving set and exchange property for nanosheet structure [PDF]
HeliyonThe exploration of edge metric dimension and its applications has been an ongoing discussion, particularly in the context of nanosheet graphs formed from the octagonal grid. Edge metric dimension is a concept that involves uniquely identifying the entire
Ali N.A. Koam +4 more
doaj +2 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
Minimum Weight Resolving Sets of Grid Graphs [PDF]
Discrete Mathematics, Algorithms and Applications, 2014 For a simple graph $G=(V,E)$ and for a pair of vertices $u,v \in V$, we say that a vertex $w \in V$ resolves $u$ and $v$ if the shortest path from $w$ to $u$ is of a different length than the shortest path from $w$ to $v$. A set of vertices ${R \subseteq
Andersen, Patrick +2 more
core +2 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
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 +2 more sources
All metric bases and fault-tolerant metric dimension for square of grid [PDF]
Opuscula Mathematica, 2022 For a simple connected graph \(G=(V,E)\) and an ordered subset \(W = \{w_1,w_2,\ldots, w_k\}\) of \(V\), the code of a vertex \(v\in V\), denoted by \(\mathrm{code}(v)\), with respect to \(W\) is a \(k\)-tuple \((d(v,w_1),\ldots, d(v, w_k))\), where \(d ...
Laxman Saha +2 more
doaj +1 more source
A Study on Fuzzy Resolving Domination Sets and Their Application in Network Theory
Mathematics, 2023 Consider a simple connected fuzzy graph (FG) G and consider an ordered fuzzy subset H = {(u1, σ(u1)), (u2, σ(u2)), …(uk, σ(uk))}, |H| ≥ 2 of a fuzzy graph; then, the representation of σ − H is an ordered k-tuple with regard to H of G. If any two elements
Manimozhi Vasuki +3 more
doaj +1 more source
A Study of Independency on Fuzzy Resolving Sets of Labelling Graphs
Mathematics, 2023 Considering a fuzzy graph G is simple and can be connected and considered as a subset H=u1,σu1,u2,σu2,…uk,σuk, |H|≥2; then, every two pairs of elements of σ−H have a unique depiction with the relation of H, and H can be termed as a fuzzy resolving set ...
Ramachandramoorthi Shanmugapriya +3 more
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