Results 41 to 50 of about 9,666,055 (254)
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 +33 more
wiley +1 more source
Upper bounds for domination related parameters in graphs on surfaces
AKCE 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
Weakly connected domination subdivision numbers [PDF]
, 2008 A set D of vertices in a graph G = (V,E) is a weakly connected dominating set of G if D is dominating in G and the subgraph weakly induced by D is connected.
Raczek, Joanna
core +1 more source
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 +7 more
wiley +1 more source
Total mixed domination in graphs
AKCE 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
The e-mail gossip number and the connected domination number [PDF]
, 1997 Our object is to introduce eg(G), the e-mail gossip number of a connected graph G, and derive a simple equation expressing this new invariant in terms of the known [1] connected domination number cd(G).
Raghavachari, B. +3 more
core +1 more source
Calpain small subunit homodimerization is robust and calcium‐independent
FEBS Letters, EarlyView.Calpains dimerize via penta‐EF‐hand (PEF) domains. Using single‐molecule force spectroscopy, we measured the strength and kinetics of PEF–PEF homodimer binding. The interaction is robust, shows a transient conformational step before dissociation, and remains largely insensitive to Ca2+.
Nesha May O. Andoy +4 more
wiley +1 more source
Connected domination number of graph [PDF]
, 2014 V diplomskem delu je obravnavano povezano dominantno število grafa. Na začetku so podrobneje razloženi osnovni pojmi teorije grafov, ki so potrebni za razumevanje celotnega dela. V osrednjem delu so opisane lastnosti povezanega dominantnega števila grafa
Smej, Renato
core
Connected and outer-connected domination number of middle graphs
, 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).
Kazemnejad, Farshad +3 more
core
Bounds relating the weakly connected domination number to the total domination number and the matching number [PDF]
, 2009 Let G=(V,E) be a connected graph. A dominating set S of G is a weakly connected dominating set of G if the subgraph (V,E∩(S×V)) of G with vertex set V that consists of all edges of G incident with at least one vertex of S is connected.
Hattingh, Johannes H. +1 more
core +1 more source