a {em roman dominating function} on a graph $g = (v ,e)$ is a function $f : vlongrightarrow {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 {em weight} of a roman dominating function is the value $w(f)=sum_{vin v}f(v)$. the roman domination number of a graph $g$, denoted by $gamma_r(g)$, equals the...

Recensé : Collectif Rosa Bonheur, La ville vue d’en bas. Travail et production de l’espace populaire, Paris, Éditions Amsterdam, 2019, 227 p.

En 2020, la série télévisée thaïlandaise 2gether The Series a réussi à devenir l’un des programmes thaïlandais les plus populaires dans le reste de l’Asie orientale. Son succès agité presse régionale et réseaux sociaux monde entier. Ce n’est pas sans raisons. est fois une qui s’adapte aux attentes ses consommateurs étrangers tout en restant thaïe. La présente Thaïlande comme partageant temporal...

We present a survey of con uence properties of (acyclic) term graph rewriting. Results and counterexamples are given for di erent kinds of term graph rewriting: besides plain applications of rewrite rules, extensions with the operations of collapsing and copying, and with both operations together are considered. Collapsing and copying together constitute bisimilarity of term graphs. We establis...

Dans l’entre-deux-guerres en France, un réseau d’enseignement et d’éducation par le cinéma se constitue sous nom de éducateur laïque. Animé les instituteurs l’école laïque organisé la Ligue l’enseignement, ce développe raison du travail conjoint des associations parlementaires, qui appartiennent au monde l’éducation populaire Les films Jean Benoît-Lévy constituent fers lance qui, tout menant un...

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...

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,...

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. The Roman reinforc...