Results 31 to 40 of about 855,405 (264)
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
Limit sets of stable Cellular Automata [PDF]
, 2013 We study limit sets of stable cellular automata standing from a symbolic dynamics point of view where they are a special case of sofic shifts admitting a steady epimorphism.
Alexis Ballier, Santiago Chile
core +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
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
Properties of Fuzzy Resolving Set
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.
openaire +2 more sources
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
Resolving Sets without Isolated Vertices
Procedia Computer Science, 2015 AbstractLet G be a connected graph. Let W = (w1, w2, ..., wk ) be a subset of V with an order imposed on it. For any v ∈ V, the vector r(v|W) = (d(v, w1), d(v, w2), ..., d(v, wk )) is called the metric representation of v with respect to W. If distinct vertices in V have distinct metric representations, then W is called a resolving set of G.
Chitra, P. Jeya Bala, Arumugam, S.
openaire +1 more source
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
Bounds for metric dimensions of generalized neighborhood corona graphs
Heliyon, 2021 In this paper, the authors analysed metric dimensions of arbitrary graphs G★˜∧i=1|V(G)|Hi in which graphs G,H1,H2,…,H|V(G)| are non-trivial, G is connected, and ★˜ denotes generalized neighborhood corona operation.
Rinurwati, S.E. Setiawan, Slamin
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