Results 51 to 60 of about 11,214,082 (296)
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 +4 more
wiley +1 more source
Total domination number of middle graphs
Electronic Journal of Graph Theory and Applications, 2022 A total dominating set of a graph G with no isolated vertices is a subset S of the vertex set such that every vertex of G is adjacent to a vertex in S. The total domination number of G is the minimum cardinality of a total dominating set.
Farshad Kazemnejad +3 more
doaj +1 more source
Total dominator color class total dominating sets in ladder and mobius ladder graph
Malaya Journal of Matematik, 2021 Let $G$ be a finite, undirected and connected graph with minimum degree at least one. A proper coloring $\mathcal{C}$ of $G$ is said to be a total dominator color class total dominating set of $G$ if each vertex properly dominates a color class in $\mathcal{C}$ and each color class in $\mathcal{C}$ is properly dominated by a vertex in $\mathrm{V ...
null A. Vijayalekshmi, null S. Abisha
openaire +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
Hamiltonicity of 3tEC Graphs with α=κ+1
Journal of Mathematics, 2021 A set S of vertices in a graph G is a total dominating set of G if every vertex of G is adjacent to some vertex in S. The minimum cardinality of a total dominating set of G is the total domination number γtG of G.
Huanying He, Xinhui An, Zongjun Zhao
doaj +1 more source
Vertices contained in all or in no minimum total dominating set of a tree [PDF]
, 2003 A set S of vertices in a graph G is a total dominating set of G if every vertex of G is adjacent to some vertex in S. We characterize the set of vertices of a tree that are contained in all, or in no, minimum total dominating sets of the ...
Cockayne, Ernest J. +2 more
core +1 more source
Therapeutic Apheresis and Dialysis, EarlyView.ABSTRACT Background Japan has one of the highest dialysis prevalence rates worldwide and a shrinking, aging population. Whether dialysis burden has entered a sustained post‐peak phase or whether recent declines partly reflect pandemic‐related disruptions remains uncertain.
Hatice Şahin +2 more
wiley +1 more source
Locating and Total Dominating Sets in Trees. [PDF]
, 2004 A set S of vertices in a graph G=(V,E) is a total dominating set of G if every vertex of V is adjacent to some vertex in S. In this thesis, we consider total dominating sets of minimum cardinality which have the additional property that distinct ...
Howard, Jamie Marie
core +1 more source
3-Tuple Total Domination Number of Rook’s Graphs
Discussiones Mathematicae Graph Theory, 2022 A k-tuple total dominating set (kTDS) of a graph G is a set S of vertices in which every vertex in G is adjacent to at least k vertices in S. The minimum size of a kTDS is called the k-tuple total dominating number and it is denoted by γ×k,t(G).
Pahlavsay Behnaz +2 more
doaj +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