Results 61 to 70 of about 7,042,445 (296)

Chemotherapy for Spinal Cord Intramedullary Pediatric Low‐Grade Glioma—A Systematic Literature Review

open access: yesPediatric Blood &Cancer, EarlyView.
ABSTRACT Pediatric intramedullary low‐grade gliomas (PIMLGGs) are rare neoplasms that present unique clinical and management challenges. Although surgery remains the primary tool for tissue diagnosis and decompression, complete gross‐total resection is frequently unfeasible due to the infiltrative nature of these lesions.
Olga M. Sergeenko   +5 more
wiley   +1 more source

Lower Bounds for the Total Distance $k$-Domination Number of a Graph

open access: yesTheory and Applications of Graphs
For $k \geq 1$ and a graph $G$ without isolated vertices, a \emph{total distance $k$-dominating set} of $G$ is a set of vertices $S \subseteq V(G)$ such that every vertex in $G$ is within distance $k$ to some vertex of $S$ other than itself.
Randy R. Davila
doaj   +1 more source

Therapeutic Apheresis in Nigeria: A Multi‐Center Summary of Abstracts From the Inaugural Nigerian Society for Apheresis Scientific Meeting

open access: yesTherapeutic Apheresis and Dialysis, EarlyView.
ABSTRACT Background Therapeutic apheresis (TA) is an established treatment modality for hematologic, neurologic, and immunologic disorders, yet access remains severely limited in sub‐Saharan Africa. Donor apheresis, including platelet apheresis collection from healthy donors, represents an important complementary modality supporting blood product ...
Nosa Bazuaye   +33 more
wiley   +1 more source

Bounds On The Disjunctive Total Domination Number Of A Tree

open access: yesDiscussiones Mathematicae Graph Theory, 2016
Let G be a graph with no isolated vertex. In this paper, we study a parameter that is a relaxation of arguably the most important domination parameter, namely the total domination number, γt(G).
Henning Michael A., Naicker Viroshan
doaj   +1 more source

Total restrained reinforcement in graphs

open access: yesAKCE International Journal of Graphs and Combinatorics, 2016
In this paper we initiate the study of total restrained reinforcement in graphs. The total restrained reinforcement number in a graph G with no isolated vertex, is the minimum number of edges that have to be added to G so that the resulting graph has ...
Nader Jafari Rad, Lutz Volkmann
doaj   +1 more source

Effectiveness of Resistance Intradialytic Exercise Compared to Aerobic Intradialytic Exercise for Patients With Chronic Kidney Disease: A Randomized Controlled Clinical Trial

open access: yesTherapeutic Apheresis and Dialysis, EarlyView.
ABSTRACT Background Patients with chronic kidney disease undergoing hemodialysis commonly experience reduced physical function, fatigue, poor sleep quality, and impaired health‐related quality of life. Intradialytic exercise has been proposed as a non‐pharmacological strategy to improve these outcomes.
Klebson da Silva Almeida   +6 more
wiley   +1 more source

Total [1,2]-domination in Graphs

open access: yesActa Mathematicae Applicatae Sinica, English Series, 2018
17 ...
Lv, Xue-Zheng, Wu, Baoyindureng
openaire   +2 more sources

Total Transversals and Total Domination in Uniform Hypergraphs [PDF]

open access: yesThe Electronic Journal of Combinatorics, 2014
In 2012, the first three authors established a relationship between the transversal number and the domination number of uniform hypergraphs. In this paper, we establish a relationship between the total transversal number and the total domination number of uniform hypergraphs.
Csilla Bujtás   +3 more
openaire   +4 more sources

Total Domination Cover Rubbling

open access: yes, 2020
Let G be a connected simple graph with vertex set V and a distribution of pebbles on the vertices of V. The total domination cover rubbling number of G is the minimum number of pebbles, so that no matter how they are distributed, it is possible that ...
Haynes, Teresa W.   +3 more
core   +1 more source

Two Short Proofs on Total Domination

open access: yesDiscussiones Mathematicae Graph Theory, 2013
A set of vertices of a graph G is a total dominating set if each vertex of G is adjacent to a vertex in the set. The total domination number of a graph Υt (G) is the minimum size of a total dominating set.
Bickle Allan
doaj   +1 more source

Home - About - Disclaimer - Privacy