Results 51 to 60 of about 146,548 (294)
Application of neutrosophic resolving sets in earthquake disaster management using neutrosophic graph models [PDF]
Neutrosophic Sets and SystemsNeutrosophic graphs are more suitable for modelling real-life situations because real world data is often uncertain, incomplete, inconsistent, or indeterminate and neutrosophic graphs are specifically designed to handle all of neutrosophic graphs, these ...
R. Shanmugapriya, R. Shanmugapriya
doaj +1 more source
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
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
The independent resolving number of a graph [PDF]
, 2003 summary:For an ordered set $W=\lbrace w_1, w_2, \dots , w_k\rbrace $ of vertices in a connected graph $G$ and a vertex $v$ of $G$, the code of $v$ with respect to $W$ is the $k$-vector \[ c_W(v) = (d(v, w_1), d(v, w_2), \dots , d(v, w_k) ). \] The set $W$
Zhang, P. +2 more
core +1 more source
Therapeutic Apheresis and Dialysis, EarlyView.ABSTRACT Background Neuromyelitis optica spectrum disorder (NMOSD) is a relapsing autoimmune disease of the central nervous system. High‐dose intravenous methylprednisolone (IVMP) is the standard first‐line therapy for acute attacks, although some patients remain refractory.
Wataru Horiguchi +5 more
wiley +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
Resolving connected domination in graphs
, 2015 For an ordered subset W = w1,w2, · · · ,wk of vertices and a vertex v in a connected graph G = (V,E), the (metric) representation of v with respect to W is the k-vector r(v|W) = (d(v,w1), d(v,w2), · · · , d(v,wk)).
Soner, N. D. +3 more
core +1 more source
Organoids in pediatric cancer research
FEBS Letters, EarlyView.Organoid technology has revolutionized cancer research, yet its application in pediatric oncology remains limited. Recent advances have enabled the development of pediatric tumor organoids, offering new insights into disease biology, treatment response, and interactions with the tumor microenvironment.
Carla Ríos Arceo, Jarno Drost
wiley +1 more source
Mathematics, 2020 We consider in this work a new approach to study the simultaneous strong metric dimension of graphs families, while introducing the simultaneous version of the strong resolving graph.
Ismael González Yero
doaj +1 more source
Computation of Resolvability Parameters for Benzenoid Hammer Graph
Journal of Mathematics, 2022 A representation of each vertex of a network into distance-based arbitrary tuple form, adding the condition of uniqueness of each vertex with reference to some settled vertices. Such settled vertices form a set known as resolving set.
Ali Ahmad, Al-Nashri Al-Hossain Ahmad
doaj +1 more source