Two Latin poets of late antiquity, Claudian and Sidonius Apollinaris, included in their verse panegyrics short descriptions diplomatic journey to Persia. The first mentioned the mission Stilicho himself “Panegyric on consulate Stilicho” (400 AD), whereas latter described Procopius, father honorand Anthemius” (468 AD). Since was many ways imitator Claudian, these pieces show a great deal similar...

In the present study, two literary topics of love are introduced and its historical development is traced from classical tradition to modern culture. Also being studied Eugene O'Neill's American tragedy, Electra Is Good for Mourning (1931). These consist 'love hate' 'jealousy in love'. It argued that both comprise four stages, originate ancient Greek Roman literature evolve into culture, as wor...

The Roman imperial monarchy is generally studied from the vantage point of ancient Roman history: the “Roman emperor” is viewed and analyzed as an element of the Roman world. This conventional approach fails to place this institution in a broader comparative context, that of monarchical rulers across world history. Systematic comparison opens up new perspectives and is indispensable in identify...

Background & Objective: Human epidermal growth factor receptor 2 (HER-2) exhibits a vast range of expression in esophageal squamous...

A Roman dominating function on a graph G is a function f : V (G) → {0, 1, 2} satisfying the condition that every vertex u for which f(u) = 0 is adjacent to at least one vertex v for which f(v) = 2. The weight of a Roman dominating function is the value f(V (G)) = ∑ u∈V (G) f(u). The Roman domination number of G, γR(G), is the minimum weight of a Roman dominating function on G. In this paper, we...

A Roman dominating function (RDF) on a graph G = (V,E) is a function f : V → {0, 1, 2} satisfying the condition that every vertex u for which f(u) = 0 is adjacent to at least one vertex v for which f(v) = 2. The weight of f is w(f) = ∑ v∈V f(v). The Roman domination number is the minimum weight of an RDF in G. It is known that for every graph G, the Roman domination number of G is bounded above...

A Roman dominating function (RDF) on a graph G is a function f : V (G) → {0, 1, 2} satisfying the condition that every vertex v for which f(v) = 0, is adjacent to at least one vertex u for which f(u) = 2. The weight of a Roman dominating function f is the value f(V (G)) = ∑ v∈V (G) f(v). The Roman domination number of G, denoted by γR(G), is the minimum weight of an RDF on G. For a given graph,...