Results 181 to 190 of about 325 (215)

The Painterly Materiality of Clouds in Antony and Cleopatra and Hamlet

open access: yesRenaissance Studies, EarlyView.
Abstract This article examines the cloud‐gazing scenes in Antony and Cleopatra and Hamlet through the lens of early modern artistic theory and material practices, particularly the art of limning. Building upon existing philosophical and poetic interpretations of Shakespearean clouds as metaphors for ephemerality and memory, the essay argues that the ...
Anne‐Valérie Dulac
wiley   +1 more source

‘Who is the Gael who Would Not Weep?’: The Book of the O’Conor Don, Fearghal Óg Mac an Bhaird, and Late Bardic Poetry of Exile

open access: yesRenaissance Studies, EarlyView.
Abstract This article examines how late bardic poetry transforms the condition of exile into a literary mode that reimagines community and tradition. I argue that poetry of lament, blessing and devotion articulates a broader literary consciousness that anticipates modern notions of a national consciousness. The compilation of bardic verse in manuscript
Daniel T. McClurkin
wiley   +1 more source

Free Expression and Coerced Choice: The Role of the Army and Lord Protector in Miltonic Freedom

open access: yesRenaissance Studies, EarlyView.
ABSTRACT Scholarly approaches to understanding freedom in Milton's prose tend to connect Milton's ideas to either liberalism or republicanism. Neither of these approaches is sufficient because freedom, for Milton, was not a single concept. Milton explored political and religious freedom very differently.
Benjamin Woodford
wiley   +1 more source

Algorithmic Aspects of Total Roman and Total Double Roman Domination in Graphs

open access: yes, 2021
For a simple, undirected and connected graph \(G = (V, E)\), a total Roman dominating function (TRDF) \(f : V \rightarrow \lbrace 0, 1, 2 \rbrace \) has the property that, every vertex u with \(f(u) = 0\) is adjacent to at least one vertex v for which \(f(v) = 2\) and the subgraph induced by the set of vertices labeled one or two has no isolated ...
Chakradhar Padamutham   +1 more
openaire   +2 more sources

Total double Roman domination numbers in digraphs

Discrete Mathematics, Algorithms and Applications, 2021
Let [Formula: see text] be a finite and simple digraph with vertex set [Formula: see text]. A double Roman dominating function (DRDF) on digraph [Formula: see text] is a function [Formula: see text] such that every vertex with label 0 has an in-neighbor with label 3 or two in-neighbors with label 2 and every vertex with label 1 have at least one in ...
Jafar Amjadi, F. Pourhosseini
openaire   +2 more sources

New bounds on the outer-independent total double Roman domination number

Discrete Mathematics, Algorithms and Applications, 2023
A double Roman dominating function (DRDF) on a graph [Formula: see text] is a function [Formula: see text] satisfying (i) if [Formula: see text] then there must be at least two neighbors assigned two under [Formula: see text] or one neighbor [Formula: see text] with [Formula: see text]; and (ii) if [Formula: see text] then [Formula: see text] must be ...
Seyed Mahmoud Sheikholeslami   +1 more
openaire   +2 more sources

Home - About - Disclaimer - Privacy