Results 51 to 60 of about 9,933,640 (289)

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

Upper bounds for domination related parameters in graphs on surfaces

open access: yesAKCE International Journal of Graphs and Combinatorics, 2016
In this paper we give tight upper bounds on the total domination number, the weakly connected domination number and the connected domination number of a graph in terms of order and Euler characteristic.
Vladimir Samodivkin
doaj   +1 more source

Forcing Parameters in Fully Connected Cubic Networks

open access: yesMathematics, 2022
Domination in graphs has been extensively studied and adopted in many real life applications. The monitoring electrical power system is a variant of a domination problem called power domination problem.
Yongsheng Rao   +4 more
doaj   +1 more source

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

open access: yesTherapeutic 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   +7 more
wiley   +1 more source

Total mixed domination in graphs

open access: yesAKCE International Journal of Graphs and Combinatorics, 2022
For a graph [Formula: see text] we call a subset [Formula: see text] a total mixed dominating set of G if each element of [Formula: see text] is either adjacent or incident to an element of S, and the total mixed domination number of G is the minimum ...
Adel P. Kazemi   +2 more
doaj   +1 more source

Some inequalities about connected domination number

open access: yesDiscrete Mathematics, 1996
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cheng Bo, Bolian Liu
openaire   +2 more sources

The human gut microbiome across the life course

open access: yesFEBS Letters, EarlyView.
Despite significant individual variation and continuous change throughout life, the human gut microbiome follows some life stage‐specific trends. This article provides a brief overview of how gut microbiome composition shifts across different phases of life. Created in BioRender. Özkurt, E. (2026) https://BioRender.com/8q4nrnc.
Alise J. Ponsero   +4 more
wiley   +1 more source

On graphs for which the connected domination number is at most the total domination number. Discrete [PDF]

open access: yes, 2012
In this note we give a finite forbidden subgraph characterization of the connected graphs for which any non-trivial connected induced subgraph has the property that the connected domination number is at most the total domination number.
Oliver Schaudt
core  

Distance irredundance and connected domination numbers of a graph

open access: yesDiscrete Mathematics, 2006
Let \(k\) be a positive integer and \(G\) be a connected graph. In this paper the authors consider relations among 4 graph-theoretical parameters: the \(k\)-domination number \(\gamma_{k}(G)\), the connected \(k\)-domination number \(\gamma_{k}^{c}(G)\), the \(k\)-independent domination number \(\gamma_{k}^{i}(G)\) and the \(k\)-irredundance number ...
Jun-Ming Xu 0001, Fang Tian, Jia Huang
openaire   +2 more sources

Connected and outer-connected domination number of middle graphs

open access: yes, 2022
In this paper, we study the notions of connected domination number and of outer-connected domination number for middle graphs. Indeed, we obtain tight bounds for this number in terms of the order of the graph M(G). We also compute the outer-connected domination number of some families of graphs such as star graphs, cycle graphs, wheel graphs, complete ...
Kazemnejad, Farshad   +3 more
openaire   +2 more sources

Home - About - Disclaimer - Privacy