Results 51 to 60 of about 11,106,432 (291)

Domination and Independent Domination in Hexagonal Systems

open access: yes, 2021
A vertex subset D of G is a dominating set if every vertex in V(G)\D is adjacent to a vertex in D. A dominating set D is independent if G[D], the subgraph of G induced by D, contains no edge.
Norah Almalki, Pawaton Kaemawichanurat
core   +1 more source

The total co-independent domination number of some graph operations [PDF]

open access: yes, 2022
[EN] A set D of vertices of a graph G is a total dominating set if every vertex of G is adjacent to at least one vertex of D. The total dominating set D is called a total co-independent dominating set if the subgraph induced by V (G)- D is edgeless.
González Yero, Ismael   +4 more
core   +1 more source

Domination and independence subdivision numbers of graphs

open access: yesDiscussiones Mathematicae Graph Theory, 2000
A subset \(S\) of the vertex set \(V(G)\) of a graph \(G\) is called dominating in \(G\), if each vertex of \(G\) either is in \(S\), or is adjacent to a vertex of \(S\). A set \(S\subseteq V(G)\) is independent in \(G\), if no two vertices of \(S\) are adjacent in \(G\).
Teresa W. Haynes   +2 more
openaire   +3 more sources

An improvement on the maximum number of ‐dominating independent sets [PDF]

open access: yesJournal of Graph Theory, 2018
AbstractErdős and Moser raised the question of determining the maximum number of maximal cliques or, equivalently, the maximum number of maximal independent sets in a graph on vertices. Since then there has been a lot of research along these lines.A ‐dominating independent set is an independent set such that every vertex not contained in has at ...
Dániel Gerbner   +4 more
openaire   +4 more sources

A sharp upper bound on the independent 2-rainbow domination in graphs with minimum degree at least two [PDF]

open access: yesComputer Science Journal of Moldova, 2020
An independent 2-rainbow dominating function (I$2$-RDF) on a graph $G$ is a function $f$ from the vertex set $V(G)$ to the set of all subsets of the set $\{1,2\}$ such that $\{x\in V\mid f(x)\neq \emptyset \}$ is an independent set of $G$ and for any ...
Rana Khoeilar   +3 more
doaj  

Infant Embryonal CNS Tumors: Molecular Insights and Treatment Considerations for Contemporary Pediatric Neuro‐Oncology

open access: yesPediatric Blood &Cancer, EarlyView.
ABSTRACT Background Embryonal tumors comprise the majority of malignant central nervous system (CNS) neoplasms diagnosed in children under 3 years of age. Compared with their counterparts in older children, these tumors exhibit distinct molecular biology and a more aggressive clinical phenotype, while their management is complicated by the heightened ...
Sudarshawn Damodharan   +3 more
wiley   +1 more source

Referral Practices and Utilisation of Paediatric Oncology Physiotherapy Services in Ghana: A Cross‐Sectional Study

open access: yesPediatric Blood &Cancer, EarlyView.
ABSTRACT Introduction Physical rehabilitation is highly recognised in improving the quality of life of cancer survivors through prehabilitation, sequelae management and palliative care, yet its integration into routine care in Ghana has not been characterised, leading to potential gaps in service access.
Dorothy Ekua Adjabu   +5 more
wiley   +1 more source

Therapeutic Apheresis in Nigeria: A Multi‐Center Summary of Abstracts From the Inaugural Nigerian Society for Apheresis Scientific Meeting

open access: yesTherapeutic 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

Independent strong domination number of indu-bala product of graphs

open access: yes, 2023
A set D⊂ V be the strong dominating set of G if every vertex in V − D is strongly dominated by at least one vertex in D. The strong domination number γst(G) of G is the minimum cardinality of a strong dominating set.
Priyadharshini M.   +2 more
core   +1 more source

Effectiveness of Resistance Intradialytic Exercise Compared to Aerobic Intradialytic Exercise for Patients With Chronic Kidney Disease: A Randomized Controlled Clinical Trial

open access: yesTherapeutic 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

Home - About - Disclaimer - Privacy