Results 51 to 60 of about 1,521,521 (318)
Let G = (V;E) be a graph. A set S ⊂ V (G) is a hop dominating set of G if for every v ∈ V - S, there exists u ∈ S such that d(u; v) = 2. The minimum cardinality of a hop dominating set of G is called a hop domination number of G and is denoted by γh(G ...
Natarajan C., Ayyaswamy S.K.
doaj +1 more source
On a conjecture concerning total domination subdivision number in graphs
Let be the total domination number and let be the total domination subdivision number of a graph G with no isolated vertex. In this paper, we show that for some classes of graphs G, which partially solve the conjecture presented by Favaron et al.
S. Kosari +5 more
doaj +1 more source
Total domination game on ladder graphs [PDF]
The total domination game is played on a simple graph G by two players, named Dominator and Staller. They alternately select a vertex of G; each chosen vertex totally dominates its neighbors.
Karnchana Charoensitthichai +1 more
doaj +1 more source
Inverse Domination Number and Inverse Total Domination of Sierpinski Star Graph
Given a graph G=(V(G),E(G)) consisting of the set of vertices V(G) and the set of edges E(G). For example, D(G) is a domination set of graph G with minimum cardinality, if V(G)-D(G) contains a domination set D^(-1) (G), then D^(-1) (G) is called the ...
Ayu Anisa Wardani +3 more
semanticscholar +1 more source
On the inverse signed total domination number in graphs [PDF]
In this paper, we study the inverse signed total domination number in graphs and present new sharp lower and upper bounds on this parameter. For example by making use of the classic theorem of Turán (1941), we present a sharp upper bound on \(K_{r+1 ...
D. A. Mojdeh, B. Samadi
doaj +1 more source
Outer independent total double Italian domination number [PDF]
If $G$ is a graph with vertex set $V(G)$, then let $N[u]$ be the closed neighborhood of the vertex $u\in V(G)$. A total double Italian dominating function (TDIDF) on a graph $G$ is a function $f:V(G)\rightarrow\{0,1,2,3\}$ satisfying (i) $f(N[u])\ge 3 ...
Seyed Mahmoud Sheikholeslami +1 more
doaj +1 more source
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
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
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
Total \(k\)-rainbow domination numbers in graphs
Summary: Let \(k\geq 1\) be an integer, and let \(G\) be a graph. A \(k\)-rainbow dominating function (or a \(k\)-RDF) of \(G\) is a function \(f\) from the vertex set \(V(G)\) to the family of all subsets of \({1,2,\ldots ,k}\) such that for every \(v\in V(G)\) with \(f(v)=\emptyset\), the condition \(\bigcup_{u\in N_{G}(v)}f(u)=\{1,2,\ldots,k\}\) is ...
Abdollahzadeh Ahangar, Hossein +3 more
openaire +2 more sources

