Results 51 to 60 of about 17,112 (263)

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

Therapeutic 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, Chimezie Okwuonu, Evelyn Idam, Folasade Adelekan‐Popoola, Shakirat Gold‐Olufadi, Olufunto Olufela Kalejaiye, Abdullateef Ogala, Zinnah Aloziem, Blossom Amamchukwu, Patience Elimia, Mkpoikanabasi Obot‐Obot, Henry Mbakwe, Praises Maduagwuna, Olatunji Akinrodoye, Chiamaka Anyanwu, Benjamin Anyanwu, Adedamola Akinsiku, Oluwatoyin A. Akinsiku, Muzamil O. Hassan, Fatiu A. Arogundade, Olalekan E. Ojo, Homayemem Weli, Jesupelumi Adenihun, Aderemi Adelaja, Ebun Bamgboye, Olalekan Olatise, Ade E. Faponle, Ayoola Odeyemi, Michael Muoka, Stephen Asaolu, Qudrat Busari, Blessing Dawudu, Michael Naiyeju, Rasheed A. Balogun   +33 more
wiley   +1 more source

On graphs with equal domination and 2-domination numbers

Discrete Mathematics, 2008
Let \(G\) be a simple graph, and let \(p\) be a positive integer. A subset \(D\subseteq V(G)\) is a p-dominating set of the graph \(G\), if every vertex \(v\in V(G)-D\) is adjacent to at least \(p\) vertices in \(D\). The \(p\)-domination number \(\gamma_p(G)\) is the minimum cardinality among the \(p\)-dominating sets of \(G\).
Adriana Hansberg, Lutz Volkmann
openaire   +1 more source

On the Domination Number of a Random Graph [PDF]

The Electronic Journal of Combinatorics, 2001
In this paper, we show that the domination number $D$ of a random graph enjoys as sharp a concentration as does its chromatic number $\chi$. We first prove this fact for the sequence of graphs $\{G(n,p_n\},\; n\to\infty$, where a two point concentration is obtained with high probability for $p_n=p$ (fixed) or for a sequence $p_n$ that approaches ...
Wieland, Ben, Godbole, Anant P.
openaire   +3 more sources

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

Therapeutic 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, Gisela Cristiane Miyamoto, Daniel da Costa Torres, Ian Setubal Reis Chaves, Jonas do Carmo Paschoalin, Braúlio Lima Nascimento, Luciana Dias Chiavegato   +6 more
wiley   +1 more source

Establishing an Apheresis Medicine Program in a Resource‐Constrained Setting: A 5‐Year Experience From Lagos, Nigeria

Therapeutic Apheresis and Dialysis, EarlyView.
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, Shakirat Gold‐Olufadi, Olufunto Olufela Kalejaiye, Abdullateef Ogala, Rasheed A. Balogun   +4 more
wiley   +1 more source

On graphs with equal domination and connected domination numbers

Discrete Mathematics, 1999
A subset \(S\) of the vertex set \(V(G)\) of a graph \(G\) is called dominating in \(G\), if each vertex of \(G\) either is in \(S\), or is adjacent to a vertex of \(S\). The minimum number of vertices of a dominating set in \(G\) is the dominating number \(\gamma(G)\) of \(G\).
S. Arumugam 0001, J. Paulraj Joseph
openaire   +1 more source

Safety of Daprodustat for the Treatment of Chronic Kidney Disease Anemia: Final Analysis of a Multicenter Postmarketing Surveillance Study in Japan

Therapeutic Apheresis and Dialysis, EarlyView.
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, Kyomi Kanaya, Kiyomi Aizawa, Masanori Onoki, Hirofumi Ozeki, Kazuko Suzuki, Ai Hayashi, Tomohiko Asamura   +7 more
wiley   +1 more source

On a Relation between the Perfect Roman Domination and Perfect Domination Numbers of a Tree

Mathematics, 2020
A dominating set in a graph G is a set of vertices S ⊆ V ( G ) such that any vertex of V − S is adjacent to at least one vertex of S .
Zehui Shao, Saeed Kosari, Mustapha Chellali, Seyed Mahmoud Sheikholeslami, Marzieh Soroudi   +4 more
doaj   +1 more source

Block Graphs with Large Paired Domination Multisubdivision Number

Discussiones Mathematicae Graph Theory, 2021
The paired domination multisubdivision number of a nonempty graph G, denoted by msdpr(G), is the smallest positive integer k such that there exists an edge which must be subdivided k times to increase the paired domination number of G.
Mynhardt Christina M., Raczek Joanna
doaj   +1 more source

Maker–Breaker Domination Number [PDF]

Bulletin of the Malaysian Mathematical Sciences Society, 2019
The Maker-Breaker domination game is played on a graph $G$ by Dominator and Staller. The players alternatively select a vertex of $G$ that was not yet chosen in the course of the game. Dominator wins if at some point the vertices he has chosen form a dominating set. Staller wins if Dominator cannot form a dominating set.
Valentin Gledel, Vesna Iršič, Sandi Klavžar   +2 more
openaire   +2 more sources