Results 51 to 60 of about 53,392 (268)
Augmenting graphs to partition their vertices into a total dominating set and an independent dominating set [PDF]
Opuscula MathematicaA 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
False alarms in fault-tolerant dominating sets in graphs [PDF]
Opuscula Mathematica, 2012 We develop the problem of fault-tolerant dominating sets (liar's dominating sets) in graphs. Namely, we consider a new kind of fault - a false alarm.
Mateusz Nikodem
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
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
Eternal Independent Sets in Graphs
Theory and Applications of Graphs, 2016 The use of mobile guards to protect a graph has received much attention in the literature of late in the form of eternal dominating sets, eternal vertex covers and other models of graph protection.
Yair Caro, William Klostermeyer
doaj +1 more source
Dominating Vertex Covers: The Vertex-Edge Domination Problem
Discussiones Mathematicae Graph Theory, 2021 The vertex-edge domination number of a graph, γve(G), is defined to be the cardinality of a smallest set D such that there exists a vertex cover C of G such that each vertex in C is dominated by a vertex in D.
Klostermeyer William F. +2 more
doaj +1 more source
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
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
Dominating Sets in Perfect Graphs
Discrete Mathematics, 1990 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Derek G. Corneil, Lorna K. Stewart
openaire +2 more sources
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