Results 41 to 50 of about 146,548 (294)
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
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
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
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
Overlarge sets of resolvable idempotent quasigroups
Discrete Mathematics, 2012 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Y. Chang +3 more
openaire +2 more sources
DIMENSI METRIK GRAPH LOBSTER Ln (q;r)
E-Jurnal Matematika, 2013 The metric dimension of connected graph G is the cardinality of minimum resolving set in graph G. In this research, we study how to find the metric dimension of lobster graph Ln (q;r).
PANDE GDE DONY GUMILAR +2 more
doaj +1 more source
Primatika, 2019 Graf merupakan suatu (V, E) dengan V adalah himpunan simpul dan E adalah himpunan edge, yaitu pasangan simpul dari V. Jika G adalah graf terhubung, jarak antara dua simpul u dan v di G dinotasikan dengan adalah panjang lintasan terpendek di antara ...
Petrus Fendiyanto
doaj +1 more source
The Non-Isolated Resolving Number of Some Corona Graphs [PDF]
, 2018 An ordered set W = {w1, w2, ..., wk} ⊆ V(G) and a vertex v in a connected graph G, the representation of v with respect to W is the ordered k-tuple r(v|W) = (d(v, w1), d(v, w2), ..., d(v, wk)), where d(x, y) represents the distance between the vertices x
Salman, Anm +2 more
core +1 more source
The Role of Hematopoietic Cell Transplantation in Ataxia‐Telangiectasia
Pediatric Blood &Cancer, EarlyView.ABSTRACT Background Ataxia‐telangiectasia (A‐T) is a DNA repair disorder characterized by neurodegeneration, immunodeficiency, and cancer predisposition. Hematopoietic cell transplantation (HCT) is an established therapy in related disorders such as Fanconi anemia (FA) and Nijmegen breakage syndrome (NBS), but its role in A‐T is unclear.
Laila Alkhouli +3 more
wiley +1 more source