Results 1 to 10 of about 72,011 (256)
Double Roman domination and domatic numbers of graphs [PDF]
Communications in Combinatorics and Optimization, 2018 A double Roman dominating function on a graph $G$ with vertex set $V(G)$ is defined in \cite{bhh} as a function $f:V(G)\rightarrow\{0,1,2,3\}$ having the property that if $f(v)=0$, then the vertex $v$ must have at least two neighbors assigned 2 ...
L. Volkmann
doaj +4 more sources
An improved upper bound on the independent double Roman domination number of trees [PDF]
AKCE International Journal of Graphs and Combinatorics, 2022 For a graph [Formula: see text] an independent double Roman dominating function (IDRDF) is a function [Formula: see text] having the property that: (i) every vertex [Formula: see text] with f(v) = 0 has a neighbor u with f(u) = 3 or at least two ...
F. Nahani Pour +3 more
doaj +3 more sources
Bounds on the global double Roman domination number in graphs [PDF]
Discussiones Mathematicae Graph Theory, 2022 Summary: Let \(G\) be a simple graph of order \(n\) and let \(\gamma_{\mathrm{gdR}}(G)\) be the global double Roman domination number of \(G\). In this paper, we give some upper bounds on the global double Roman domination number of \(G\). In particular, we completely characterize the graph \(G\) with \(\gamma_{\mathrm{gdR}}(G)=2n-2\) and \(\gamma_ ...
Guoliang Hao +3 more
doaj +3 more sources
More results on the signed double Roman domination number of graphs
AKCE International Journal of Graphs and CombinatoricsA signed double Roman dominating function (SDRD-function) on a graph G is defined as a function [Formula: see text] having the property that [Formula: see text] for each [Formula: see text] and if [Formula: see text], then the vertex u must have a ...
Seyed Mahmoud Sheikholeslami +1 more
doaj +4 more sources
On the Outer Independent Double Roman Domination Number [PDF]
Bulletin of the Iranian Mathematical Society, 2021 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Doost Ali Mojdeh +3 more
+7 more sources
The double Roman domination number of generalized Sierpiński graphs [PDF]
Discrete Mathematics, Algorithms and Applications, 2020 In this paper, we study the double Roman domination number of generalized Sierpiński graphs [Formula: see text]. More precisely, we obtain a bound for the double Roman domination number of [Formula: see text]. We also find the exact value of [Formula: see text].
Anu, V., Lakshmanan, S. Aparna
+6 more sources
The Double Roman Domination Numbers of Generalized Petersen Graphs P(n, 2) [PDF]
Mathematics, 2018 A double Roman dominating function (DRDF) f on a given graph G is a mapping from V ( G ) to { 0 , 1 , 2 , 3 } in such a way that a vertex u for which f ( u ) = 0 has at least a neighbor labeled 3 or two neighbors both labeled 2 ...
Huiqin Jiang +4 more
doaj +4 more sources
Calculating Modern Roman Domination of Fan Graph and Double Fan Graph [PDF]
Journal of Applied Sciences and Nanotechnology, 2022 This paper is concerned with the concept of modern Roman domination in graphs. A Modern Roman dominating function on a graph is labeling such that every vertex with label 0 is adjacent to two vertices; one of them of label 2 and the other of label 3 and ...
Saba Salah, Ahmed Omran, Manal Al-Harere
doaj +1 more source
Total double Roman domination in graphs [PDF]
Communications in Combinatorics and Optimization, 2020 Let $G$ be a simple graph with vertex set $V$. A double Roman dominating function (DRDF) on $G$ is a function $f:V\rightarrow\{0,1,2,3\}$ satisfying that if $f(v)=0$, then the vertex $v$ must be adjacent to at least two vertices assigned $2$ or one ...
Guoliang Hao +2 more
doaj +1 more source
On the D-differential of a graph
AKCE International Journal of Graphs and Combinatorics, 2022 Let [Formula: see text] be a graph of order n(G). For a subset S of V(G), the boundary of S is defined as [Formula: see text] where N(S) is the open neighborhood of S.
Kijung Kim
doaj +1 more source