Results 51 to 60 of about 14,893,384 (293)
Total restrained domination numbers of trees
Discrete Mathematics, 2008 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Joanna Raczek, Joanna Cyman
openaire +1 more source
New Bounds on the Signed Total Domination Number of Graphs
Discussiones Mathematicae Graph Theory, 2016 In this paper, we study the signed total domination number in graphs and present new sharp lower and upper bounds for this parameter. For example by making use of the classic theorem of Turán [8], we present a sharp lower bound on Kr+1-free graphs for r ≥
Moghaddam Seyyed Mehdi Hosseini +3 more
doaj +1 more source
Outer independent total double Italian domination number [PDF]
Computer Science Journal of MoldovaIf $G$ is a graph with vertex set $V(G)$, then let $N[u]$ be the closed neighborhood of the vertex $u\in V(G)$. A total double Italian dominating function (TDIDF) on a graph $G$ is a function $f:V(G)\rightarrow\{0,1,2,3\}$ satisfying (i) $f(N[u])\ge 3 ...
Seyed Mahmoud Sheikholeslami +1 more
doaj +1 more source
Minimum Randić Index of Trees with Fixed Total Domination Number
Mathematics, 2022 The Randić index is among the most famous degree-based topological indices in chemical graph theory. It was introduced due to its application in modeling the properties of certain molecular structures and has been extensively studied.
Ayu Ameliatul Shahilah Ahmad Jamri +4 more
doaj +1 more source
Pediatric Blood &Cancer, EarlyView.ABSTRACT Pediatric intramedullary low‐grade gliomas (PIMLGGs) are rare neoplasms that present unique clinical and management challenges. Although surgery remains the primary tool for tissue diagnosis and decompression, complete gross‐total resection is frequently unfeasible due to the infiltrative nature of these lesions.
Olga M. Sergeenko +5 more
wiley +1 more source
Perfect Domination Excellent Trees [PDF]
, 2012 A set D of vertices of a graph G is a perfect dominating set if every vertex in V \ D is adjacent to exactly one vertex in D. In this paper we introduce the concept of perfect domination excellent graph as a graph in which every vertex belongs to some ...
Sharada, B., Sharada B.
core +1 more source
Total Roman Domination Number of Rooted Product Graphs
Mathematics, 2020 Let G be a graph with no isolated vertex and f:V(G)→{0,1,2} a function. If f satisfies that every vertex in the set {v∈V(G):f(v)=0} is adjacent to at least one vertex in the set {v∈V(G):f(v)=2}, and if the subgraph induced by the set {v∈V(G):f(v)≥1} has ...
Abel Cabrera Martínez +3 more
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
Total outer-connected domination number of middle graphs [PDF]
, 2023 In this paper, we study the total outer-connected domination number of the middle graph of a simple graph and we obtain tight bounds for this number in terms of the order of the middle graph. We also compute the total outer-connected domination number of
Kazemnejad, Farshad +3 more
core
Therapeutic Apheresis and Dialysis, EarlyView.ABSTRACT Background Patients with chronic kidney disease undergoing hemodialysis commonly experience reduced physical function, fatigue, poor sleep quality, and impaired health‐related quality of life. Intradialytic exercise has been proposed as a non‐pharmacological strategy to improve these outcomes.
Klebson da Silva Almeida +6 more
wiley +1 more source