Results 41 to 50 of about 85,053 (298)
The Elegiac Puella as Virgin Martyr [PDF]
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
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
Independent Double Roman Domination in Graphs
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Maimani, Hamidreza +4 more
openaire +3 more sources
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
'Eastern' Elegy and 'Western' Epic:reading 'orientalism' in Propertius 4 and Virgil's Aeneid [PDF]
This article explores the extent to which the genres of epic and elegy can be considered ‘occidental’ and ‘oriental’ respectively. Such a polarity is apparently constructed in the ‘epic’ and ‘elegiac’ movements of Propertius 4.1, but it is also ...
O'Rourke, Donncha
core +2 more sources
Perfect double Roman domination of trees
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Egunjobi, Ayotunde T., Haynes, Teresa W.
openaire +3 more sources
Protection of Lexicographic Product Graphs
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
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
A Note on the Edge Roman Domination in Trees [PDF]
A subset $X$ of edges of a graph $G$ is called an \textit{edgedominating set} of $G$ if every edge not in $X$ is adjacent tosome edge in $X$. The edge domination number $\gamma'(G)$ of $G$ is the minimum cardinality taken over all edge dominating sets of
Rad, N. J. (Nader)
core +2 more sources

