Results 51 to 60 of about 8,016,307 (335)
Resolving Independent Dominating Set pada Graf Bunga, Graf Gear, dan Graf Bunga Matahari
Contemporary Mathematics and Applications (ConMathA), 2023 Resolving independent dominating set is the development of metric dimension and independent dominating set. Resolving independent dominating sets is a concept which discusses about determining the minimum vertex on a graph provided that the vertex that ...
Rafiantika Megahniah Prihandini +4 more
doaj +1 more source
On the Metric Dimension of Cartesian Products of Graphs [PDF]
, 2005 A set S of vertices in a graph G resolves G if every vertex is uniquely determined by its vector of distances to the vertices in S. The metric dimension of G is the minimum cardinality of a resolving set of G.
Brigham R. C. +27 more
core +5 more sources
On 2-Resolving Sets in the Join and Corona of Graphs
European Journal of Pure and Applied Mathematics, 2021 Let G be a connected graph. An ordered set of vertices {v1, ..., vl} is a 2-resolving set in 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
semanticscholar +1 more source
Coloring Cantor sets and resolvability of pseudocompact spaces [PDF]
Commentationes Mathematicae Universitatis Carolinae, 2019 Let us denote by $ ( , )$ the statement that $\mathbb{B}( ) = D( )^ $, i.e. the Baire space of weight $ $, has a coloring with $ $ colors such that every homeomorphic copy of the Cantor set $\mathbb{C}$ in $\mathbb{B}( )$ picks up all the $ $ colors. We call a space $X\,$ {\em $ $-regular} if it is Hausdorff and for every non-empty open set $
Juhász, István +2 more
openaire +3 more sources
Metric and fault-tolerant metric dimension for GeSbTe superlattice chemical structure.
PLoS ONE, 2023 The concept of metric dimension has many applications, including optimizing sensor placement in networks and identifying influential persons in social networks, which aids in effective resource allocation and focused interventions; finding the source of ...
Liu Liqin +4 more
doaj +1 more source
On Resolving Hop Domination in Graphs
European Journal of Pure and Applied Mathematics, 2021 A set S of vertices in a connected graph G is a resolving hop dominating set of G if S is a resolving set in G and for every vertex v ∈ V (G) \ S there exists u ∈ S such that dG(u, v) = 2.
Jerson Mohamad, Helen M. Rara
semanticscholar +1 more source
New results on metric-locating-dominating sets of graphs [PDF]
, 2016 A dominating set S of a graph is a metric-locating-dominating set if each vertex of the graph is uniquely distinguished by its distanc es from the elements of S , and the minimum cardinality of such a set is called the metri c-location- domination number.
González, Antonio +2 more
core +3 more sources
Resolvent Estimates for Normally Hyperbolic Trapped Sets [PDF]
Annales Henri Poincaré, 2011 Further changes to erratum correcting small problems with Section 3.5 and Lemma 4.1; this now also corrects hypotheses, explicitly requiring trapped set to be symplectic.
Wunsch, Jared, Zworski, Maciej
openaire +2 more sources
Fault-Tolerant Resolvability and Extremal Structures of Graphs
Mathematics, 2019 In this paper, we consider fault-tolerant resolving sets in graphs. We characterize n-vertex graphs with fault-tolerant metric dimension n, n − 1 , and 2, which are the lower and upper extremal cases.
Hassan Raza +3 more
doaj +1 more source
Metric dimension of fullerene graphs
Electronic Journal of Graph Theory and Applications, 2019 A resolving set W is a set of vertices of a graph G(V, E) such that for every pair of distinct vertices u, v ∈ V(G), there exists a vertex w ∈ W satisfying d(u, w) ≠ d(v, w).
Shehnaz Akhter, Rashid Farooq
doaj +1 more source