Results 31 to 40 of about 862,623 (267)
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 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
On the total Roman domination stability in graphs
AKCE International Journal of Graphs and Combinatorics, 2021 A total Roman dominating function on a graph G is a function satisfying the conditions: (i) every vertex u with f(u) = 0 is adjacent to at least one vertex v of G for which f(v) = 2; (ii) the subgraph induced by the vertices assigned non-zero values has ...
Ghazale Asemian +3 more
doaj +1 more source
Total Roman {2}-Dominating Functions in Graphs
Discussiones Mathematicae Graph Theory, 2022 A Roman {2}-dominating function (R2F) is a function f : V → {0, 1, 2} with the property that for every vertex v ∈ V with f(v) = 0 there is a neighbor u of v with f(u) = 2, or there are two neighbors x, y of v with f(x) = f(y) = 1.
Ahangar H. Abdollahzadeh +3 more
doaj +1 more source
Critical graphs with Roman domination number four
AKCE International Journal of Graphs and Combinatorics, 2020 A Roman domination function on a graph G is a function satisfying the condition that every vertex u for which r(u) = 0 is adjacent to at least one vertex v for which r(v) = 2.
A. Martínez-Pérez, D. Oliveros
doaj +1 more source
On trees with equal Roman domination and outer-independent Roman domination number [PDF]
Communications in Combinatorics and Optimization, 2019 A Roman dominating function (RDF) on a graph $G$ is a function $f : V (G) \to \{0, 1, 2\}$ satisfying the condition that every vertex $u$ for which $f(u) = 0$ is adjacent to at least one vertex $v$ for which $f(v) = 2$.
S. Nazari-Moghaddam, S.M. Sheikholeslami
doaj +1 more source
Total Roman domination subdivision number in graphs [PDF]
Communications in Combinatorics and Optimization, 2020 A {\em Roman dominating function} on a graph $G$ is a function $f:V(G)\rightarrow \{0,1,2\}$ satisfying the condition that every vertex $u$ for which $f(u)=0$ is adjacent to at least one vertex $v$ for which $f(v)=2$.
Jafar Amjad
doaj +1 more source
Graphs with Large Hop Roman Domination Number [PDF]
Computer Science Journal of Moldova, 2019 A subset $S$ of vertices of a graph $G$ is a hop dominating set if every vertex outside $S$ is at distance two from a vertex of $S$. A Roman dominating function on a graph $G=(V,E)$ is a function $f: V(G) \longrightarrow \{0, 1, 2\}$ satisfying the ...
E. Shabani, N. Jafari Rad, A. Poureidi
doaj
A note on Roman domination of digraphs
Discussiones Mathematicae Graph Theory, 2019 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chen Xiaodan, Hao Guoliang, Xie Zhihong
openaire +2 more sources
ALGORITHMIC ASPECTS OF ROMAN GRAPHS [PDF]
Journal of Algebraic Systems, 2021 Let $G=(V, E)$ be a graph. A set $S \subseteq V$ is called a dominating set of $G$ if for every $v\in V-S$ there is at least one vertex $u \in N(v)$ such that $u\in S$.
A. Poureidi
doaj +1 more source