Results 51 to 60 of about 366,581 (319)
Game total domination critical graphs [PDF]
In the total domination game played on a graph $G$, players Dominator and Staller alternately select vertices of $G$, as long as possible, such that each vertex chosen increases the number of vertices totally dominated. Dominator (Staller) wishes to minimize (maximize) the number of vertices selected. The game total domination number, $ _{\rm tg}(G)$,
Henning, Michael A. +2 more
openaire +2 more sources
ABSTRACT Introduction Cognitive impairment and exercise intolerance are common in dialysis patients. Cerebral perfusion and oxygenation play a major role in both cognitive function and exercise execution; HD session per se aggravates cerebral ischemia in this population. This study aimed to compare cerebral oxygenation and perfusion at rest and in mild
Marieta P. Theodorakopoulou +10 more
wiley +1 more source
Total restrained reinforcement in graphs
In this paper we initiate the study of total restrained reinforcement in graphs. The total restrained reinforcement number in a graph G with no isolated vertex, is the minimum number of edges that have to be added to G so that the resulting graph has ...
Nader Jafari Rad, Lutz Volkmann
doaj +1 more source
Total domination versus paired domination [PDF]
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
Plasmodium falciparum gametogenesis essential protein 1 (GEP1) is a transmission‐blocking target
This study shows Plasmodium falciparum GEP1 is vital for activating sexual stages of malarial parasites even independently of a mosquito factor. Knockout parasites completely fail gamete formation even when a phosphodiesterase inhibitor is added. Two single‐nucleotide polymorphisms (V241L and S263P) are found in 12%–20% of field samples.
Frederik Huppertz +5 more
wiley +1 more source
Bounds On The Disjunctive Total Domination Number Of A Tree
Let G be a graph with no isolated vertex. In this paper, we study a parameter that is a relaxation of arguably the most important domination parameter, namely the total domination number, γt(G).
Henning Michael A., Naicker Viroshan
doaj +1 more source
Reciprocal control of viral infection and phosphoinositide dynamics
Phosphoinositides, although scarce, regulate key cellular processes, including membrane dynamics and signaling. Viruses exploit these lipids to support their entry, replication, assembly, and egress. The central role of phosphoinositides in infection highlights phosphoinositide metabolism as a promising antiviral target.
Marie Déborah Bancilhon, Bruno Mesmin
wiley +1 more source
Two Short Proofs on Total Domination
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
Phototrophs evolved light‐harvesting systems adapted for efficient photon capture in habitats enriched in far‐red radiation. A subset of eukaryotic pigment‐binding proteins can absorb far‐red photons via low‐energy chlorophyll states known as red forms.
Antonello Amelii +8 more
wiley +1 more source
Total Domination on Tree Operators
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

