Results 11 to 20 of about 85,878 (263)
Discrete Applied Mathematics, 2016 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Beeler, Robert A. +2 more
openaire +4 more sources
Signed double Roman domination in graphs
Discrete Applied Mathematics, 2019 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hossein Abdollahzadeh Ahangar +2 more
openaire +5 more sources
Maximal double Roman domination in graphs
Applied Mathematics and Computation, 2022 A maximal double Roman dominating function (MDRDF) on a graph $G=(V,E)$ is a function $f:V(G)\rightarrow \{0,1,2,3\}$ such that \textrm{(i) }every vertex $v$ with $f(v)=0$ is adjacent to least two vertices { assigned $2$ or to at least one vertex assigned $3,$} \textrm{(ii) }every vertex $v$ with $f(v)=1$ is adjacent to at least one { vertex assigned ...
Abdollahzadeh Ahangar, H. +3 more
openaire +4 more sources
Discharging Approach for Double Roman Domination in Graphs
IEEE Access, 2018 The discharging method is most well-known for its central role in the proof of the Four Color Theorem. This proof technique was extensively applied to study various graph coloring problems, in particular on planar graphs.
Zehui Shao +5 more
doaj +3 more sources
Perfect double Roman domination of trees
Discrete Applied Mathematics, 2020 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Egunjobi, Ayotunde T., Haynes, Teresa W.
openaire +5 more sources
The Double Roman Domination Numbers of Generalized Petersen Graphs P(n, 2)
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 +3 more sources
On the double Roman domination in graphs
Discrete Applied Mathematics, 2017 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Abdollahzadeh Ahangar, Hossein +2 more
openaire +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
Bounds on the Double Italian Domination Number of a Graph
Discussiones Mathematicae Graph Theory, 2022 For a graph G, a Roman {3}-dominating function is a function f : V → {0, 1, 2, 3} having the property that for every vertex u ∈ V, if f(u) ∈ {0, 1}, then f(N[u]) ≥ 3.
Azvin Farzaneh, Rad Nader Jafari
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