Results 51 to 60 of about 368,338 (322)
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 domination and vertex-edge domination in trees [PDF]
Proyecciones (Antofagasta), 2019 A vertex v of a graph G = (V,E) is said to ve-dominate every edge incident to v, as well as every edge adjacent to these incident edges. A set S ⊆ V is a vertex-edge dominating set if every edge of E is ve-dominated by at least one vertex of S. The minimum cardinality of a vertex-edge dominating set of G is the vertex-edge domination number γve(G) . In
Venkatakrishnan Y. B. +2 more
openaire +3 more sources
Therapeutic Apheresis and Dialysis, EarlyView.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
Bounds On The Disjunctive Total Domination Number Of A Tree
Discussiones Mathematicae Graph Theory, 2016 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
FEBS Letters, EarlyView.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
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
FEBS Letters, EarlyView.Fluorescent probes allow dynamic visualization of phosphoinositides in living cells (left), whereas mass spectrometry provides high‐sensitivity, isomer‐resolved quantitation (right). Their synergistic use captures complementary aspects of lipid signaling. This review illustrates how these approaches reveal the spatiotemporal regulation and quantitative
Hiroaki Kajiho +3 more
wiley +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
An intracellular transporter mitigates the CO2‐induced decline in iron content in Arabidopsis shoots
FEBS Letters, EarlyView.This study identifies a gene encoding a transmembrane protein, MIC, which contributes to the reduction of shoot Fe content observed in plants under elevated CO2. MIC is a putative Fe transporter localized to the Golgi and endosomal compartments. Its post‐translational regulation in roots may represent a potential target for improving plant nutrition ...
Timothy Mozzanino +7 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