Results 21 to 30 of about 2,477,819 (60)
On the Roman Edge Domination Number of a Graph [PDF]
, 2010 Let G be a simple graph with vertex set V (G) and edge set E(G)
K. Ebadi +5 more
core +1 more source
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
Some Properties of Double Roman Domination
, 2020 A double Roman dominating function on a graph G is a function f:VG⟶0,1,2,3 satisfying the conditions that every vertex u for which fu=0 is adjacent to at least one vertex v for which fv=3 or two vertices v1 and v2 for which fv1=fv2=2 and every vertex u ...
Xiaoqing Zhou, Hong Yang
core +1 more source
On Roman, Global and Restrained Domination in Graphs [PDF]
, 2010 In this paper, we present new upper bounds for the global domination and Roman domination numbers and also prove that these results are asymptotically best possible.
Zverovich, Vadim +3 more
core +1 more source
Signed strong Roman domination in graphs
, 2017 Let $G=(V,E)$ be a finite and simple graph of order $n$ and maximum degree $\Delta$. A signed strong Roman dominating function (abbreviated SStRDF) on a graph $G$ is a function $f:V\to \{-1,1,2,\ldots,\lceil\frac{\Delta}{2}\rceil+1\}$ satisfying the ...
Seyed Mahmoud Sheikholeslami +2 more
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 +3 more
core +1 more source
Twin signed total Roman domination numbers in digraphs
, 2018 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
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 +1 more source
Signed total Roman $k$-domination in directed graphs
, 2016 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
Signed domination numbers of directed graphs [PDF]
, 2005 summary:The concept of signed domination number of an undirected graph (introduced by J. E. Dunbar, S. T. Hedetniemi, M. A. Henning and P. J. Slater) is transferred to directed graphs. Exact values are found for particular types of tournaments.
Zelinka, Bohdan
core +1 more source