Results 51 to 60 of about 369,294 (274)
Two Short Proofs on Total Domination
Discussiones Mathematicae Graph Theory, 2013 A set of vertices of a graph G is a total dominating set if each vertex of G is adjacent to a vertex in the set. The total domination number of a graph Υt (G) is the minimum size of a total dominating set.
Bickle Allan
doaj +1 more source
k-Tuple_Total_Domination_in_Inflated_Graphs
, 2011 The inflated graph $G_{I}$ of a graph $G$ with $n(G)$ vertices is obtained from $G$ by replacing every vertex of degree $d$ of $G$ by a clique, which is isomorph to the complete graph $K_{d}$, and each edge $(x_{i},x_{j})$ of $G$ is replaced by an edge $(
Kazemi, Adel P.
core +1 more source
Pediatric Blood &Cancer, EarlyView.ABSTRACT Objective To evaluate the diagnostic yield and utility of universal paired tumor–normal multigene panel sequencing in newly diagnosed pediatric solid and central nervous system (CNS) tumor patients and to compare the detection of germline pathogenic/likely pathogenic variants (PV/LPVs) against established clinical referral criteria for cancer ...
Natalie Waligorski +9 more
wiley +1 more source
Intravitreal GD2‐Specific Chimeric Antigen Receptor T‐Cell Therapy for Refractory Retinoblastoma
Pediatric Blood &Cancer, EarlyView.ABSTRACT Effective treatments for advanced, treatment‐resistant retinoblastoma (RB) remain limited. GD2‐specific chimeric antigen receptor (CAR) T cells show potent antitumor activity with minimal toxicity but have not previously been evaluated in RB.
Subongkoch Subhadhirasakul +13 more
wiley +1 more source
Bounds on weak and strong total domination in graphs
Electronic Journal of Graph Theory and Applications, 2016 A set $D$ of vertices in a graph $G=(V,E)$ is a total dominatingset if every vertex of $G$ is adjacent to some vertex in $D$. Atotal dominating set $D$ of $G$ is said to be weak if everyvertex $v\in V-D$ is adjacent to a vertex $u\in D$ such that$d_{G}(v)
M.H. Akhbari, Nader Jafari Rad
doaj +1 more source
Total Domination on Tree Operators
Mediterranean Journal of Mathematics, 2022 AbstractLet G be a graph with vertex set V and edge set E, a set $$D\subseteq V$$ D ⊆ V is a total dominating set if every vertex $$v\in V$$ v ∈ V
openaire +3 more sources
Pediatric Blood &Cancer, EarlyView.ABSTRACT Background Nurses are central to cancer care for children and adolescents, yet no comprehensive synthesis has defined essential core competencies for pediatric oncology nursing (PON) practice internationally, particularly in Latin America and the Caribbean (LAC).
Luís Carlos Lopes‐Júnior +7 more
wiley +1 more source
Hop total Roman domination in graphs
AKCE International Journal of Graphs and Combinatorics, 2023 In this article, we initiate a study of hop total Roman domination defined as follows: a hop total Roman dominating function (HTRDF) on a graph [Formula: see text] is a function [Formula: see text] such that for every vertex u with f(u) = 0 there exists ...
H. Abdollahzadeh Ahangar +3 more
doaj +1 more source
Total domination versus paired domination [PDF]
, 2011 A dominating set of a graph G is a vertex subset that any vertex of G either belongs to or is adjacent to. A total dominating set is a dominating set whose induced subgraph does not contain isolated vertices.
Schaudt, Oliver
core
Total Transversals and Total Domination in Uniform Hypergraphs [PDF]
The Electronic Journal of Combinatorics, 2014 In 2012, the first three authors established a relationship between the transversal number and the domination number of uniform hypergraphs. In this paper, we establish a relationship between the total transversal number and the total domination number of uniform hypergraphs.
Bujtás, Csilla +3 more
openaire +3 more sources