Results 1 to 10 of about 72,658 (227)
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 +2 more sources
Bounds on signed total double Roman domination [PDF]
Communications in Combinatorics and Optimization, 2020 A signed total double Roman dominating function (STDRDF) on {an} isolated-free graph $G=(V,E)$ is a function $f:V(G)\rightarrow\{-1,1,2,3\}$ such that (i) every vertex $v$ with $f(v)=-1$ has at least two neighbors assigned 2 under $f$ or one neighbor ...
L. Shahbazi +3 more
doaj +2 more sources
On the Total Double Roman Domination [PDF]
IEEE Access, 2019 Let G = (V, E) be a simple graph. A double Roman dominating function (DRDF) on G is a function f from the vertex set V of G into {0, 1, 2, 3} such that if f (u) = 0, then u must have at least two neighbors assigned 2 or one neighbor assigned 3 under f ...
Zehui Shao +3 more
doaj +2 more sources
Quasi total double Roman domination in graphs
AKCE International Journal of Graphs and CombinatoricsA quasi total double Roman dominating function (QTDRD-function) on a graph [Formula: see text] is a function [Formula: see text] having the property that (i) if f(v) = 0, then vertex v must have at least two neighbors assigned 2 under f or one neighbor w
S. Kosari +4 more
doaj +2 more sources
Signed total double Roman dominating functions in graphs
AKCE International Journal of Graphs and CombinatoricsA signed total double Roman dominating function (STDRDF) on an isolated-free graph [Formula: see text] is a function [Formula: see text] such that (i) every vertex v with [Formula: see text] has at least two neighbors assigned 2 under f or one neighbor w
L. Shahbazi +2 more
doaj +2 more sources
Protection of Lexicographic Product Graphs
Discussiones Mathematicae Graph Theory, 2022 In this paper, we study the weak Roman domination number and the secure domination number of lexicographic product graphs. In particular, we show that these two parameters coincide for almost all lexicographic product graphs. Furthermore, we obtain tight
Klein Douglas J. +1 more
doaj +1 more source
On the Outer Independent Total Double Roman Domination in Graphs
Mediterranean Journal of Mathematics, 2023 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Abdollahzadeh Ahangar, H. +3 more
openaire +3 more sources
Bounds on the total double Roman domination number of graphs
Discussiones Mathematicae Graph Theory, 2023 Summary: Let \(G\) be a simple graph with no isolated vertex and let \(\gamma_{tdR}(G)\) be the total double Roman domination number of \(G\). In this paper, we present lower and upper bounds on \(\gamma_{tdR}(G)\) of a graph \(G\) in terms of the order, open packing number and the numbers of support vertices and leaves, and we characterize all ...
Hao, Guoliang +3 more
openaire +1 more source
Domination parameters with number 2: Interrelations and algorithmic consequences [PDF]
, 2018 In this paper, we study the most basic domination invariants in graphs, in which number 2 is intrinsic part of their definitions. We classify them upon three criteria, two of which give the following previously studied invariants: the weak 2-domination ...
Bonomo, Flavia +4 more
core +2 more sources
Relativism and universalism in interrogation fairness: a comparative analysis between Europe and China [PDF]
, 2012 This paper addresses Chinese interrogation rules from historical and comparative perspectives by relating them to the very different development of interrogation procedure in Europe.
Vander Beken, Tom, Wu, Wei
core +2 more sources