A Roman dominating function of a graph G = (V, E) is a function f : V → {0, 1, 2} such that every vertex x with f (x) = 0 is adjacent to at least one vertex y with f (y) = 2. The weight of a Roman dominating function is defined to be f (V ) = ∑ x∈V f (x), and the minimum weight of a Roman dominating function on a graph G is called the Roman domination number of G. In this paper we first answer ...

A Roman dominating function of a graph G = (V,E) is a function f : V → {0, 1, 2} such that every vertex x with f(x) = 0 is adjacent to at least one vertex y with f(y) = 2. The weight of a Roman dominating function is defined to be f(V ) = P x∈V f(x), and the minimum weight of a Roman dominating function on a graph G is called the Roman domination number of G. In this paper we answer an open pro...

The practice of Common Law and Roman Law differ, even though both systems in theory permit what they don't prohibit. The Common Practice derived from Common Law in fact truly does tend to permit what it doesn't prohibit, while the Roman Practice derived from Roman Law tends to prohibit what it doesn't permit. Tracing the historical sources for the evolutionary divergence between current Roman P...

Our first tendency is to look outside Europe when searching for ancient rhetorics that do not follow the Greco-Roman tradition. After all, much of European culture was strongly influenced by Roman culture, especially following the conquests of Julius Caesar in 58-51 BCE and subsequent conquests that brought most of Europe under Roman control. Rome’s civic practices, including variations of Grec...

A Roman dominating function on a graph G = (V,E) is a function f : V → {0, 1, 2} such that every vertex v ∈ V with f(v) = 0 has at least one neighbor u ∈ V with f(u) = 2. The weight of a Roman dominating function is the value f(V (G)) = ∑ u∈V (G) f(u). The minimum weight of a Roman dominating function on a graph G is called the Roman domination number, denoted by γR(G). The Roman bondage number...

A signed Roman dominating function (SRDF) on a graph G is a function f : V (G) → {−1, 1, 2} such that u∈N [v] f(u) ≥ 1 for every v ∈ V (G), and every vertex u ∈ V (G) for which f(u) = −1 is adjacent to at least one vertex w for which f(w) = 2. A set {f1, f2, . . . , fd} of distinct signed Roman dominating functions on G with the property that ∑d i=1 fi(v) ≤ 1 for each v ∈ V (G), is called a sig...

Using a survey of adults in Nebraska, we find that the association between church attendance and mental health varies across religious traditions and across two distinct dimensions of mental health—depressive symptoms and positive affect. Specifically, the association between church attendance and depressive symptoms differs for mainline Protestants, evangelical Protestants, and Catholics. Of t...

A Roman domination function on a graph G is a function r : 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 function is the value r(V (G)) = ∑ u∈V (G) r(u). The Roman domination number γR(G) of G is the minimum weight of a Roman domination function on G . "Roman Criticality" has been ...

houchang golchiri, écrivain iranien et auteur du prince ehtejab, l’une des œuvres capitales de la littérature moderne persane, a rédigé en 1971 un roman intitulé christine et kid, inspiré largement du nouveau roman français et imité même, sur le plan thématique et structural, de la jalousie d’alain robbe-grillet. l’histoire du roman de golchiri se tisse autour de l’hyperthème de la jalousie, ma...