Results 21 to 30 of about 85,185 (270)

Double Roman reinforcement number in graphs

open access: yesAKCE International Journal of Graphs and Combinatorics, 2021
For a graph a double Roman dominating function is a function having the property that if f(v) = 0, then vertex v must have at least two neighbors assigned 2 under f or one neighbor w with f(w) = 3, and if f(v) = 1, then vertex v must have at least one ...
J. Amjadi, H. Sadeghi
doaj   +1 more source

Signed double Italian domination

open access: yesAIMS Mathematics, 2023
A signed double Italian dominating function (SDIDF) on a graph $ G = (V, E) $ is a function $ f $ from $ V $ to $ \{-1, 1, 2, 3\} $, satisfying (ⅰ) $ \sum_{u\in N[v]}f(u)\ge1 $ for all $ v\in V $; (ⅱ) if $ f(v) = -1 $ for some $ v\in V $, then there ...
Ahlam Almulhim
doaj   +1 more source

Perfect double Italian domination of a graph

open access: yesAKCE International Journal of Graphs and Combinatorics, 2023
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

Domination parameters with number 2: Interrelations and algorithmic consequences [PDF]

open access: yes, 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

Double Roman Graphs in P(3k, k)

open access: yesMathematics, 2021
A double Roman dominating function on a graph G=(V,E) is a function f:V→{0,1,2,3} with the properties that if f(u)=0, then vertex u is adjacent to at least one vertex assigned 3 or at least two vertices assigned 2, and if f(u)=1, then vertex u is ...
Zehui Shao   +5 more
doaj   +1 more source

Queer cryptograms, anarchist cyphers: decoding Dennis Cooper's The marbled swarm: a novel [PDF]

open access: yes, 2012
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

Further results on independent double roman trees

open access: yesAKCE International Journal of Graphs and Combinatorics, 2022
A double Roman dominating function (DRDF) on a graph [Formula: see text] is a function [Formula: see text] such that every vertex u with f(u) = 0 is adjacent to at least one vertex assigned a 3 or to at least two vertices assigned a 2, and every vertex v
A. Rahmouni   +3 more
doaj   +1 more source

The Elegiac Puella as Virgin Martyr [PDF]

open access: yes, 2009
This is a postprint (author's final draft) version of an article published in the journal Transactions of the American Philological Association in 2009. The final version of this article may be found at http://dx.doi.org/10.1353/apa.0.0023 (login may be ...
Uden, James
core   +2 more sources

An improved upper bound on the independent double Roman domination number of trees

open access: yesAKCE 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   +1 more source

Relativism and universalism in interrogation fairness: a comparative analysis between Europe and China [PDF]

open access: yes, 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

Home - About - Disclaimer - Privacy