Results 31 to 40 of about 150,008 (260)
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
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
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
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
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
Pediatric Blood &Cancer, EarlyView.ABSTRACT Background Children with sickle cell anemia (SCA) in low‐income settings are at risk of severe malnutrition, but optimal nutritional management has not been established. We evaluated an intensified ready‐to‐use therapeutic food (RUTF) regimen in children with persistent severe malnutrition after initial treatment and assessed whether early ...
Safiya Gambo +9 more
wiley +1 more source
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
Pediatric Blood &Cancer, EarlyView.ABSTRACT Background Survivors of pediatric brain tumors (PBTs) can experience long‐term social difficulties, impacting quality of life. Beyond medical and environmental factors, family psychosocial risk may play a role in social outcomes by shaping the caregiving environment and may provide intervention options.
Renske H. Houben +4 more
wiley +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