Results 51 to 60 of about 98,924 (189)
The Double Roman Domatic Number of a Digraph
Discussiones Mathematicae Graph Theory, 2020 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
Masculine crusaders, effeminate Greeks, and the female historian: relations of power in Sir Walter Scott's Count Robert of Paris [PDF]
, 2017 Gender employed as a methodological lens in the analysis of historical fiction can help to reveal implicit or explicit evaluative statements. It is deployed here to examine hierarchies in the military, political and cultural context of the encounter ...
Kolovou, Ioulia
core
'Eastern' Elegy and 'Western' Epic:reading 'orientalism' in Propertius 4 and Virgil's Aeneid [PDF]
, 2011 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
Delenda est haec Carthago: the Ostend company as a problem of European great power politics (1722-1727) [PDF]
, 2015 The Ostend Company (1722-1731) is a symbol of present-day Belgium’s strangling by European Great Power politics in the Ancien Régime, and more specifically of the limitations imposed on the Southern Netherlands by the Dutch Republic in 1648.
Dhondt, Frederik
core +3 more sources
Further Results on Generous Roman Domination [PDF]
Mathematics Interdisciplinary ResearchLet G=(V(G),E(G)) be a graph and h be a function defined from V(G) to {0,1,2,3}. A vertex x with h(x)=0 is said to be undefended with respect to $h$ if it has no neighbor assigned 2 or 3 under h.
Seyed Mahmoud Sheikholeslami +2 more
doaj +1 more source
Outer Independent Double Roman Domination Stability in Graphs
Ars Comb.An outer independent double Roman dominating function (OIDRDF) on a graph G is a function f : V ( G ) → { 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 +2 more
semanticscholar +1 more source
Just Purchasing? Practicing Our Faith at the Market [PDF]
, 2008 This document is part of a digital collection provided by the Martin P. Catherwood Library, ILR School, Cornell University, pertaining to the effects of globalization on the workplace worldwide.
International Labor Rights Forum +1 more
core +1 more source
Bounds on the Total Double Roman Domination Number of Graphs
Discussiones Mathematicae Graph Theory, 2021 Let G be a simple graph with no isolated vertex and let γtdR(G) be the total double Roman domination number of G. In this paper, we present lower and upper bounds on γtdR (G) of a graph G in terms of the order, open packing number and the numbers of ...
Guoliang Hao +3 more
semanticscholar +1 more source