Results 61 to 70 of about 8,830,736 (317)
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 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
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
Prioritized Repairing and Consistent Query Answering in Relational Databases [PDF]
, 2011 A consistent query answer in an inconsistent database is an answer obtained in every (minimal) repair. The repairs are obtained by resolving all conflicts in all possible ways.
A Fuxman +14 more
core +7 more sources
Metric dimension of ideal-intersection graph of the ring
AKCE International Journal of Graphs and Combinatorics, 2021 Metric Dimension of a simple connected graph is the minimum number of vertices those are used to identify each vertex of the graph uniquely using distance code. In this paper, we determine metric dimension of ideal-intersection graph for the ring where n
Laxman Saha +2 more
doaj +1 more source
Kyoto Journal of Mathematics, 1986 We want to add here another two proofs that the resolvent set of a linear operator is open. The first proof depends on the Hahn-Banach theorem and the second on the Neumann series construction of a linear isomorphism between Ran(A-\(\lambda)\) and Ran(A-\(\mu)\).
Ikebe, Teruo, Yoshioka, Takashi
openaire +3 more sources
Pediatric Blood &Cancer, EarlyView.ABSTRACT Blinatumomab has been shown to be highly effective for patients with pediatric B‐ALL and has recently become standard of care therapy. Due to its past use in the clinical trial setting, there is limited information available about real‐world administration.
Katelyn Oranges +12 more
wiley +1 more source
The Resolving Graph of Amalgamation of Cycles [PDF]
, 2010 For an ordered set W = {w_1,w_2,...,w_k} of vertices 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,w_1),d(v,w_2),...,d(v,w_k)) where d(x,y) represents the distance between the ...
Baskoro, Edy Tri +3 more
core
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