Results 41 to 50 of about 98,924 (189)
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
On the Double Roman Domination in Generalized Petersen Graphs P(5k,k)
Mathematics, 2022 A double Roman dominating function on a graph G=(V,E) is a function f:V→{0,1,2,3} satisfying the condition that every vertex u for which f(u)=0 is adjacent to at least one vertex assigned 3 or at least two vertices assigned 2, and every vertex u with f(u)
Darja Rupnik Poklukar, Janez Žerovnik
doaj +1 more source
The Restrained Double Roman Domination and Graph Operations
Applied Mathematics and Computation, 2023 Let $G=(V(G),E(G))$ be a simple graph. A restrained double Roman dominating function (RDRD-function) of $G$ is a function $f: V(G) \rightarrow \{0,1,2,3\}$ satisfying the following properties: if $f(v)=0$, then the vertex $v$ has at least two neighbours assigned 2 under $f$ or one neighbour $u$ with $f(u)=3$; and if $f(v)=1$, then the vertex $v$ must ...
Zhipeng Gao, Changqing Xi, Jun Yue
openaire +3 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
openaire +1 more source
Restrained condition on double Roman dominating functions
Applied Mathematics and Computation, 2023 We continue the study of restrained double Roman domination in graphs. For a graph $G=\big{(}V(G),E(G)\big{)}$, a double Roman dominating function $f$ is called a restrained double Roman dominating function (RDRD function) if the subgraph induced by $\{v\in V(G)\mid f(v)=0\}$ has no isolated vertices. The restrained double Roman domination number (RDRD
Babak Samadi +6 more
openaire +3 more sources
Independent Double Roman Domination Stability in Graph
European Journal of Pure and Applied MathematicsAn independent double Roman dominating function (IDRD-function) on a graph $G$ is a function $f :V(G)\to \{0, 1, 2, 3\}$ having the property that (i) if $f(v) = 0$, then the vertex $v$ must have at least two neighbors assigned 2 under $f$ or one neighbor
S. Sheikholeslami +4 more
semanticscholar +1 more source
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 weak Roman domination number of lexicographic product graphs
, 2018 A vertex $v$ of a graph $G=(V,E)$ is said to be undefended with respect to a function $f: V \longrightarrow \{0,1,2\}$ if $f(v)=0$ and $f(u)=0$ for every vertex $u$ adjacent to $v$.
Pérez-Rosés, Hebert +2 more
core +1 more source
Opiate of Christ; or, John's Gospel and the Spectre of Class [PDF]
, 2016 This article applies a Libertarian Marxist lens to the Gospel of John. In doing so, it highlights the agrarian-aristocratic class struggle that is refracted in the text and also seeks to problematize hierarchi- cal and authoritarian ideologies. Its point
Robert Myles
core +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 +1 more source