Results 61 to 70 of about 490,847 (283)

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 disjoint dominating and 2-dominating sets

Discussiones Mathematicae Graph Theory, 2013
A DD2-pair of a graph G is a pair (D,D2) of disjoint sets of vertices of G such that D is a dominating set and D2 is a 2-dominating set of G. Although there are infinitely many graphs that do not contain a DD2-pair, we show that every graph with minimum degree at least two has a DD2-pair.
Michael A. Henning, Douglas F. Rall
openaire   +2 more sources

Fast algorithms for min independent dominating set

, 2009
We first devise a branching algorithm that computes a minimum independent dominating set on any graph with running time O*(2^0.424n) and polynomial space. This improves the O*(2^0.441n) result by (S. Gaspers and M. Liedloff, A branch-and-reduce algorithm
D.S. Johnson, J.M. Byskov, J.W. Moon, M. Cygan, M.M. Halldórsson, M.R. Garey, N. Bourgeois, N. Bourgeois, P. Alimonti, S. Gaspers   +9 more
core   +2 more sources

Bounds on the Locating-Domination Number and Differentiating-Total Domination Number in Trees

Discussiones Mathematicae Graph Theory, 2018
A subset S of vertices in a graph G = (V,E) is a dominating set of G if every vertex in V − S has a neighbor in S, and is a total dominating set if every vertex in V has a neighbor in S.
Rad Nader Jafari, Rahbani Hadi
doaj   +1 more source

Augmenting graphs to partition their vertices into a total dominating set and an independent dominating set [PDF]

Opuscula Mathematica
A graph \(G\) whose vertex set can be partitioned into a total dominating set and an independent dominating set is called a TI-graph. There exist infinite families of graphs that are not TI-graphs. We define the TI-augmentation number \(\operatorname{ti}(
Teresa W. Haynes, Michael A. Henning
doaj   +1 more source

Results on Relatively Prime Domination Number of Vertex Switching of Some Graphs

Ratio Mathematica, 2023
If a set S ⊆ V has at least two members and every pair of vertices u and v is such that (d(u), d(v)) = 1, then it is said to be a relatively prime dominating set.
A Jancy Vini, C Jayasekaran
doaj   +1 more source

Prognosis of Long‐Term Continuous Renal Replacement Therapy and the Impact of Combined Continuous Intravenous Sodium Infusion Therapy

Therapeutic Apheresis and Dialysis, EarlyView.
ABSTRACT Introduction Patients requiring long‐term continuous renal replacement therapy (CRRT) generally have poor prognoses. This study evaluated whether adding continuous intravenous sodium infusion (cIVNa) is associated with improved hemodynamics and outcomes in patients undergoing long‐term CRRT for ≥ 7 days.
Akinori Yamaguchi, Atsuyoshi Mita, Kosuke Sonoda, Makoto Harada, Koji Hashimoto, Hiroshi Imamura, Yuji Kamijo   +6 more
wiley   +1 more source

Locating-dominating sets in hypergraphs [PDF]

Periodica Mathematica Hungarica, 2016
A hypergraph is a generalization of a graph where edges can connect any number of vertices. In this paper, we extend the study of locating-dominating sets to hypergraphs. Along with some basic results, sharp bounds for the location-domination number of hypergraphs in general and exact values with specified conditions are investigated.
Muhammad Fazil, Imran Javaid, Muhammad Salman, Usman Ali 0008   +3 more
openaire   +3 more sources

Characterizing minimal point set dominating sets

AKCE International Journal of Graphs and Combinatorics, 2016
A set D of vertices in a graph G=(V,E) is said to be a point-set dominating set (or, in short, psd-set) of G if for every subset S of V−D there exists a vertex v∈D such that the subgraph 〈S∪{v}〉 is connected; the set of all psd-sets of G will be denoted ...
Purnima Gupta, Rajesh Singh, S. Arumugam
doaj   +1 more source

Reciprocal control of viral infection and phosphoinositide dynamics

FEBS Letters, EarlyView.
Phosphoinositides, although scarce, regulate key cellular processes, including membrane dynamics and signaling. Viruses exploit these lipids to support their entry, replication, assembly, and egress. The central role of phosphoinositides in infection highlights phosphoinositide metabolism as a promising antiviral target.
Marie Déborah Bancilhon, Bruno Mesmin
wiley   +1 more source