Results 51 to 60 of about 43,787 (293)
Neighbourhood total domination in graphs [PDF]
Let \(G = (V,E)\) be a graph without isolated vertices. A dominating set \(S\) of \(G\) is called a neighbourhood total dominating set (ntd-set) if the induced subgraph \(\langle N(S)\rangle\) has no isolated vertices.
S. Arumugam, C. Sivagnanam
doaj +1 more source
ABSTRACT Background Adolescents with haematological malignancies face significant emotional and relational challenges, often accompanied by difficulties in communicating their needs within the healthcare context. To address these issues, a narrative‐based psycho‐educational intervention based on the creation and prescription of Ironic Medications was ...
Marta Stoppa +7 more
wiley +1 more source
Total domination number of middle graphs
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
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
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
ACCURATE AND TOTAL ACCURATE DOMINATING SETS OF INTERVAL GRAPHS [PDF]
Interval graphs have drawn the attention of many researchers for over 30 years. They are extensively studied and revealed their practical relevance for modeling problems arising in the real world.
B Maheswari, K Dhanalakshmi
core
Hamiltonicity of 3tEC Graphs with α=κ+1
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
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
3-Tuple Total Domination Number of Rook’s Graphs
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
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

