Results 21 to 30 of about 9,316,109 (203)
Restrained double Roman domination of a graph
For a graph G = (V, E), a restrained double Roman dominating function is a function f : V → {0, 1, 2, 3} having the property that if f(v) = 0, then the vertex v must have at least two neighbors assigned 2 under f or one neighbor w with f(w) = 3, and if f(
Doost Ali Mojdeh +2 more
core +1 more source
SIGNED 2-DOMINATION IN CATERPILLARS [PDF]
summary:A caterpillar is a tree with the property that after deleting all its vertices of degree 1 a simple path is obtained. The signed 2-domination number $\gamma ^2_{\mathrm s}(G)$ and the signed total 2-domination number $\gamma ^2_{\mathrm {st}}(G)$
Zelinka, Bohdan, Bohdan Zelinka
core +1 more source
[k]-Roman Domination in Digraphs
Let D=(V(D),A(D)) be a finite, simple digraph and k a positive integer. A function f:V(D)→{0,1,2,…,k+1} is called a [k]-Roman dominating function (for short, [k]-RDF) if f(AN−[v])≥|AN−(v)|+k for any vertex v∈V(D), where AN&
Ruijuan Li, Xinhong Zhang, Xin Song
core +1 more source
Theoretical results for Perfect Location signed Roman domination problem [PDF]
The study of Roman domination has evolved to encompass a variety of challenging extensions, each contributing to the broader understanding of domination problems in graph theory.
Nikolić, Bojan +2 more
core +3 more sources
Twin signed total Roman domination numbers in digraphs
Let [Formula: see text] be a finite simple digraph with vertex set [Formula: see text] and arc set [Formula: see text]. A twin signed total Roman dominating function (TSTRDF) on the digraph [Formula: see text] is a function [Formula: see text ...
M. Soroudi, J. Amjadi
core +1 more source
Signed Roman Edge k-Domination in Graphs [PDF]
Let k ≥ 1 be an integer, and G = (V, E) be a finite and simple graph. The closed neighborhood NG[e] of an edge e in a graph G is the set consisting of e and all edges having a common end-vertex with e.
Volkmann Lutz +2 more
core +2 more sources
On the Outer Independent Total Double Roman Domination in Graphs [PDF]
A double Roman dominating function (DRDF) on a graph G=(V, E) is a function f:V→ {0,1,2,3} satisfying (i) if f(v)=0, then there must be at least two neighbors assigned 2 under f or one neighbor w with f(w)=3; and (ii) if f(v)=1 then v must be adjacent to
H. Abdollahzadeh Ahangar +11 more
core +1 more source
By integrating 516 whole‐genome resequencing datasets and 236 transcriptomes of allotetraploid common carp, this study establishes the first population‐scale atlas of transposable element (TE) variation in teleost species. TE bursts, relaxed purifying selection, and lineage‐specific loss of ancient insertions shape genome evolution and phenotypic ...
Shuimu Hu +11 more
wiley +1 more source
Brain Network Dynamics of Local and Global Predictive Processing in Aging
Separation of concurrent whole‐brain networks in source‐reconstructed magnetoencephalography (MEG) data suggests that healthy aging reorganizes, rather than uniformly attenuates, neural responses elicited from hierarchical auditory violations. Enhanced early sensory deviance processing alongside reduced higher‐order cognitive responses suggests a large‐
Mathias Houe Andersen +9 more
wiley +1 more source
Signed total Roman $k$-domination in directed graphs
Let $D$ be a finite and simple digraph with vertex set $V(D)$. A signed total Roman $k$-dominating function (STR$k$DF) on $D$ is a function $f:V(D)\rightarrow\{-1, 1, 2\}$ satisfying the conditions that (i) $\sum_{x\in N^{-}(v)}f(x)\ge k ...
L. Volkmann, N. Dehgard
core +1 more source

