Results 101 to 110 of about 9,917,456 (366)
Plasmodium falciparum gametogenesis essential protein 1 (GEP1) is a transmission‐blocking target
FEBS Letters, EarlyView.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
The ratio of domination and independent domination numbers on trees
, 2016 Let $ (G)$ and $i(G)$ be the domination number and the independent domination number of $G$, respectively. In 1977, Hedetniemi and Mitchell began with the comparison of of $i(G)$ and $ (G)$ and recently Rad and Volkmann posted a conjecture that $i(G)/ (G) \leq (G)/2$, where $ (G)$ is the maximum degree of $G$.
Wang, Shaohui, Wei, Bing
openaire +3 more sources
Computation of Various Domination Numbers of Rolf Nevanlinna (RNP) Collaboration Graph
Brazilian Archives of Biology and Technology, 2017 In this paper, we compute various Domination numbers like Outer Connected Domination (OCD), Doubly Connected Domination (DCD), Fair Domination (FD), Independence Domination (ID), 2-Packing (2-P) for Rolf Nevanlinna Prize Winners's Collaboration Graph ...
Yegnanarayanan V, Logeshwary B
doaj +1 more source
Gamma-Set Domination Graphs. I: Complete Biorientations of \u3cem\u3eq-\u3c/em\u3eExtended Stars and Wounded Spider Graphs [PDF]
, 2004 The domination number of a graph G, γ(G), and the domination graph of a digraph D, dom(D) are integrated in this paper. The γ-set domination graph of the complete biorientation of a graph G, domγ(G) is created.
Factor, Kim A. S.
core +1 more source
On the r-domination number of a graph
Discrete Mathematics, 1992 If \(r>0\) the \(r\)-domination number of a graph \(G_ n\) is the size \(d_ r\) of a smallest set of vertices such that every vertex of \(G\) is within distance \(r\) of a vertex in that set. The authors show, among other things, that if \(G\) has a spanning tree with at least \(n/2\) leaves then \(d_ r\leq\max\{n/(2r),1\}\).
Jerrold R. Griggs, Joan P. Hutchinson
openaire +2 more sources
FEBS Letters, EarlyView.Cells must clear mislocalized or faulty proteins from membranes to survive. The AAA+ ATPase Msp1 performs this task, but dissecting how its six subunits work together is challenging. We engineered linked dimers with varied numbers of functional subunits to reveal how Msp1 subunits cooperate and use energy to extract proteins from the lipid bilayer ...
Deepika Gaur +5 more
wiley +1 more source
On a Vizing-type Integer Domination Conjecture
Theory and Applications of Graphs, 2020 Given a simple graph G, a dominating set in G is a set of vertices S such that every vertex not in S has a neighbor in S. Denote the domination number, which is the size of any minimum dominating set of G, by γ(G). For any integer k ≥ 1, a function f : V
Elliot Krop, Randy Davila
doaj +1 more source
Domination number and neighbourhood conditions
Discrete Mathematics, 1999 A subset \(S\) of the vertex set of a graph \(G\) is dominating in \(G\), if each vertex of \(G\) either is in \(S\), or is adjacent to a vertex of \(S\). The minimum number of vertices of a dominating set in \(G\) is the domination number \(\gamma(G)\) of \(G\). In the paper inequalities for \(\gamma(G)\) are found, using certain numbers which concern
Chen, BF, Zhou, SM
openaire +4 more sources
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
Perfect secure domination in graphs [PDF]
Categories and General Algebraic Structures with Applications, 2017 Let $G=(V,E)$ be a graph. A subset $S$ of $V$ is a dominating set of $G$ if every vertex in $Vsetminus S$ is adjacent to a vertex in $S.$ A dominating set $S$ is called a secure dominating set if for each $vin Vsetminus S$ there exists $uin S$ such that
S.V. Divya Rashmi +3 more
doaj