Results 31 to 40 of about 1,131,018 (144)

On signed edge domination numbers of trees [PDF]

, 2002
summary:The signed edge domination number of a graph is an edge variant of the signed domination number. The closed neighbourhood $N_G[e]$ of an edge $e$ in a graph $G$ is the set consisting of $e$ and of all edges having a common end vertex with $e ...
Zelinka, Bohdan
core   +1 more source

Twin signed Roman domination numbers in directed graphs

, 2016
Let DD be a finite simple digraph with vertex set V(D)V(D) and arc set A(D)A(D). A twin signed Roman dominating function (TSRDF) on the digraph DD is a function f:V(D)→{−1,1,2}f:V(D)→{−1,1,2} satisfying the conditions that (i) ∑x∈N−[v]f(x)≥1∑x∈N−[v]f(x ...
Bodaghli, Asghar, Sheikholeslami, Seyed Mahmoud;Bodaghli, Asghar;Volkmann, Lutz, Volkmann, Lutz, Sheikholeslami, Seyyed Mahmoud   +3 more
core   +1 more source

On signed majority total domination in graphs [PDF]

, 2005
summary:We initiate the study of signed majority total domination in graphs. Let $G=(V,E)$ be a simple graph. For any real valued function $f\: V \rightarrow \mathbb{R}$ and ${S\subseteq V}$, let $f(S)=\sum _{v\in S}f(v)$.
Sun, Liang, Chen, Xue-Gang, Xing, Hua-Ming   +2 more
core   +1 more source

Double Roman Domination: A Survey

, 2023
Since 2016, when the first paper of the double Roman domination appeared, the topic has received considerable attention in the literature. We survey known results on double Roman domination and some variations of the double Roman domination, and a list ...
Janez Žerovnik, Žerovnik, Janez, Rupnik Poklukar, Darja, Darja Rupnik Poklukar   +3 more
core   +1 more source

Edge domination in graphs of cubes [PDF]

, 2002
summary:The signed edge domination number and the signed total edge domination number of a graph are considered; they are variants of the domination number and the total domination number.
Zelinka, Bohdan, Khodkar, Abdollah, Karami, H., Sheikholeslami, S. M.   +3 more
core   +1 more source

On the signed strong total Roman domination number of graphs

Tamkang Journal of Mathematics, 2022
Let $G=(V,E)$ be a finite and simple graph of order $n$ and maximumdegree $\Delta$. A signed strong total Roman dominating function ona graph $G$ is a function $f:V(G)\rightarrow\{-1, 1,2,\ldots, \lceil\frac{\Delta}{2}\rceil+1\}$ satisfying the condition that (i) forevery vertex $v$ of $G$, $f(N(v))=\sum_{u\in N(v)}f(u)\geq 1$, where$N(v)$ is the open ...
Mahmoodi, A., Atapour, M., Norouzian, S.
openaire   +1 more source

On the Complexity of Signed Roman Domination

CoRR
Given a graph $G = (V, E)$, a signed Roman dominating function is a function $f: V \rightarrow \{-1, 1, 2\}$ such that for every vertex $u \in V$: $\sum_{v \in N[u]} f(v) \geq 1$ and for every vertex $u \in V$ with $f(u) = -1$, there exists a vertex $v \in N(u)$ with $f(v) = 2$.
openaire   +2 more sources

On signed distance-$k$-domination in graphs [PDF]

, 2006
summary:The signed distance-$k$-domination number of a graph is a certain variant of the signed domination number. If $v$ is a vertex of a graph $G$, the open $k$-neighborhood of $v$, denoted by $N_k(v)$, is the set $N_k(v)=\lbrace u\mid u\ne v$ and ...
Sun, Liang, Xing, Huaming, Chen, Xuegang
core  

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, Grbić, Milana, Matić, Dragan   +2 more
core  

Interleukin-17 Genes Polymorphisms are Significantly Associated with Cutaneous T-cell Lymphoma Susceptibility. [PDF]

Acta Derm Venereol, 2022
Kołkowski K, Jolanta Gleń, Berenika Olszewska, Monika Zabłotna, Nowicki RJ, Małgorzata Sokołowska-Wojdyło.   +5 more
europepmc   +1 more source