Results 21 to 30 of about 72,600 (248)
Perfect double Italian domination of a graph
For a graph [Formula: see text] with [Formula: see text] and [Formula: see text], a perfect double Italian dominating function is a function [Formula: see text] having the property that [Formula: see text], for every vertex [Formula: see text] with ...
Guoliang Hao +2 more
doaj +1 more source
On the double Roman domination number in oriented trees
Abstract Note: Please see pdf for full abstract with equations. Let D = (V,A) be a digraph. A double Roman dominating function on a digraph D is a function ƒ :V → {0, 1, 2, 3} such that every vertex u for which ƒ(u) = 0 has an in-neighbor v for which ƒ(v) = 3 or at least two in-neighbors assigned 2 under ƒ, while if ƒ(u) = 1, then the vertex u ...
Lyes Ouldrabah +2 more
openaire +1 more source
The Double Roman Domatic Number of a Digraph
A double Roman dominating function on a digraph D with vertex set V (D) is defined in [G. Hao, X. Chen and L. Volkmann, Double Roman domination in digraphs, Bull. Malays. Math. Sci. Soc. (2017).] as a function f : V (D) → {0, 1, 2, 3} having the property
Volkmann Lutz
doaj +1 more source
On the Double Roman Domination in Generalized Petersen Graphs P(5k,k)
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
Relativism and universalism in interrogation fairness: a comparative analysis between Europe and China [PDF]
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
Independent double Roman domination in graphs
For a graph G = (V,E), a double Roman dominating function has the property that for every vertex with f(v) = 0, either there exists a vertex , with f(u) = 3, or at least two neighbors having f(x) = f(y) = 2, and every vertex with value 1 under f has at ...
H. R. Maimani +3 more
doaj +1 more source
On Two Outer Independent Roman Domination Related Parameters in Torus Graphs
In a graph G=(V,E), where every vertex is assigned 0, 1 or 2, f is an assignment such that every vertex assigned 0 has at least one neighbor assigned 2 and all vertices labeled by 0 are independent, then f is called an outer independent Roman dominating ...
Hong Gao +3 more
doaj +1 more source
Complexity of Roman {2}-domination and the double Roman domination in graphs
For a simple, undirected graph a Roman {2}-dominating function (R2DF) has the property that for every vertex with f(v) = 0, either there exists a vertex with f(u) = 2, or at least two vertices with The weight of an R2DF is the sum The minimum weight of ...
Chakradhar Padamutham +1 more
doaj +1 more source
Queer cryptograms, anarchist cyphers: decoding Dennis Cooper's The marbled swarm: a novel [PDF]
Concentrating on Dennis Cooper’s latest work, The Marbled Swarm: A Novel, a fiendishly complex, experimental tale of murder and cannibalism in Cooper’s adopted home city of Paris, I show that both the subject of the text and its formal architecture are ...
Hester, Diarmuid
core +1 more source
Opiate of Christ; or, John's Gospel and the Spectre of Class [PDF]
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

