Results 51 to 60 of about 13,357,344 (331)
Coloring Cantor sets and resolvability of pseudocompact spaces [PDF]
Commentationes Mathematicae Universitatis Carolinae, 2019 8 ...
Juhász, István +2 more
openaire +3 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
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
A Minimum Doubly Resolving Set and Strong Resolving Set for the Crystal Cubic Carbon
, 2022 Personal reasons, Professor Jia Bao Liu asked us not to mention his name in the article and to thank him only in the acknowledgments ...
Zafari, Ali, Alikhani, Saeid
openaire +2 more sources
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
Minimum weight resolving sets of grid graphs [PDF]
Discrete Mathematics, Algorithms and Applications, 2016 For a simple graph [Formula: see text] and for a pair of vertices [Formula: see text], we say that a vertex [Formula: see text] resolves [Formula: see text] and [Formula: see text] if the shortest path from [Formula: see text] to [Formula: see text] is of a different length than the shortest path from [Formula: see text] to [Formula: see text].
Andersen, Patrick +2 more
openaire +3 more sources
On The Metric Dimension of Some Operation Graphs
Cauchy: Jurnal Matematika Murni dan Aplikasi, 2018 Let be a simple, finite, and connected graph. An ordered set of vertices of a nontrivial connected graph is and the -vector represent vertex that respect to , where and is the distance between vertex and for . The set called a resolving set for
Marsidi Marsidi +4 more
doaj +1 more source
The connected partition dimension of truncated wheels
AKCE International Journal of Graphs and Combinatorics, 2021 Let G be a connected graph. For a vertex v of G and a subset S of V(G), the distance between v and S is d(v, S) = min Given an ordered k-partition = of V(G), the representation of v with respect to is the k-vector If for each pair of distinct vertices ...
Lyndon L. Lazaro, Jose B. Rosario
doaj +1 more source
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
A CHARACTERIZATION OF LOCAL RESOLVENT SETS [PDF]
Communications of the Korean Mathematical Society, 2006 Let T be a bounded linear operator on a Banach space X. And let be the local resolvent set of T at . Then we prove that a complex number belongs to if and only if there is a sequence in X such that for n = 0, 1, 2,..., = x and is bounded.
Hyuk Han, Jong-Kwang Yoo
openaire +1 more source