Results 71 to 80 of about 147,496 (294)
Fault-tolerant metric dimension of zero-divisor graphs of commutative rings
Let R be a commutative ring with identity. The zero-divisor graph of R denoted by is an undirected graph where is the set of non-zero zero-divisors of R and there is an edge between the vertices z1 and z2 in if A set of vertices S resolves a graph G if ...
Sahil Sharma, Vijay Kumar Bhat
doaj +1 more source
The Role of Chemotherapy in Pediatric Myoepithelial Carcinoma: A Systematic Review of the Literature
ABSTRACT Myoepithelial carcinoma (MEC) in pediatric patients is a rare and aggressive malignancy characterized by heterogeneous morphology and variable molecular features. The optimal role of chemotherapy remains unclear. We conducted a systematic review according to PRISMA 2020 guidelines to evaluate chemotherapy in pediatric and young‐adult patients ...
Marco Salvi +7 more
wiley +1 more source
Mixed metric dimension and exchange property of hexagonal nano-network
The mixed metric dimension of a graph is an important parameter in characterizing its structural complexity, specifically in nanoscale networks where precision is paramount.
Peide Liu +6 more
doaj +1 more source
The Resolving Graph of Amalgamation of Cycles [PDF]
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 ...
Salman, A.N.M +3 more
core
Determining Parental Factors for Clinical Trial Attrition in Pediatric Acute Lymphoblastic Leukemia
ABSTRACT Background/Objectives Despite high enrollment rates on Children's Oncology Group (COG) protocols, attrition after initial consent is challenging, introducing bias and prolonging trial completion. While adult oncology literature has identified predictors of withdrawal, little is known about caregiver decision‐making for child participation in ...
Kimberly L. Stathas +3 more
wiley +1 more source
Conditional resolvability in graphs: a survey
For an ordered set W={w1,w2,…,wk} of vertices and a vertex v in a connected graph G, the code of v with respect to W is the k-vector cW(v)=(d(v,w1),d(v,w2),…,d(v,wk)), where d(x,y) represents the distance between the vertices x and y.
Varaporn Saenpholphat, Ping Zhang
doaj +1 more source
ABSTRACT Background Establishing a comprehensive apheresis medicine program in a resource‐constrained setting presents significant structural, financial, and logistical challenges. Despite the growing clinical importance of apheresis services globally, published experience from sub‐Saharan Africa remains sparse.
Folasade Adelekan‐Popoola +4 more
wiley +1 more source
Dimensi Metrik Graf Kr+mKsr, m, r, s, En
The concept of minimum resolving set has proved to be useful and or related to a variety of fields such as Chemistry, Robotic Navigation, and Combinatorial Search and Optimization. So that, this thesis explains the metric dimension of graph Kr + mKsr, m,
Hindayani Hindayani
doaj +1 more source
ABSTRACT Introduction This final analysis of a multicenter, prospective postmarketing surveillance study evaluated the safety of daprodustat in patients with chronic kidney disease anemia in routine clinical practice in Japan. Methods Patients who initiated daprodustat between September 2020 and July 2022 were registered.
Tadao Akizawa +7 more
wiley +1 more source
Resolving Sets and Split Resolving Sets of Symmetric Designs
We study resolving sets and split resolving sets of the point-block incidence graphs of symmetric designs and we obtain general lower bounds on their cardinality. In some cases, this lower bound is just a constant factor away from the known upper bounds. In particular, we show that for any $\varepsilon>0$ there exists $q_0$ and $n_0$ such that if $q\
openaire +1 more source

