نتایج جستجو برای: roman historique

تعداد نتایج: 15826  

Journal: :recherches en langue et litterature françaises 2016
akram ayati maédé rahimi rokni

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

2008
M. Liedloff T. Kloks J. Liu S. H. Peng Mathieu Liedloff Ton Kloks Jiping Liu Sheng-Lung Peng

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

2012
H. Aram S. M. Sheikholeslami L. Volkmann

Let k be a positive integer, and let G be a simple graph with vertex set V (G). A k-distance Roman dominating function on G is a labeling f : V (G) → {0, 1, 2} such that every vertex with label 0 has a vertex with label 2 within distance k from each other. A set {f1, f2, . . . , fd} of k-distance Roman dominating functions on G with the property that ∑d i=1 fi(v) ≤ 2 for each v ∈ V (G), is call...

Journal: :Bulletin du Centre d’études médiévales d’Auxerre 2008

Journal: :T'oung Pao 1896

2007
Robert R. Rubalcaba Matt Walsh

A function f : V (G) → {0, 1, 2} is a Roman dominating function if for every vertex with f(v) = 0, there exists a vertex w ∈ N(v) with f(w) = 2. We introduce two fractional Roman domination parameters, γR ◦ f and γRf , from relaxations of two equivalent integer programming formulations of Roman domination (the former using open neighborhoods and the later using closed neighborhoods in the Roman...

Journal: :Australasian J. Combinatorics 2014
Fu-Tao Hu Jun-Ming Xu

A Roman dominating function on a graph G = (V,E) is a function f : V → {0, 1, 2} satisfying the condition that every vertex u with f(u) = 0 is adjacent to at least one vertex v with f(v) = 2. The weight of a Roman dominating function is the value f(G) = ∑ u∈V f(u). The Roman domination number of G is the minimum weight of a Roman dominating function on G. The Roman bondage number of a nonempty ...

Journal: :Continents manuscrits 2023

L’article présente le travail de documentation (archives familiales, témoignages vivants, voyages sur place, livres, articles et documents audio-visuels) ayant précédé accompagné la réalisation du nouveau roman graphique Marcelino Truong : 40 hommes 12 fusils. Indochine 1954, paru chez Denoël Graphic en octobre 2022. La genèse d’un à sujet historique implique effet une recherche documentaire ap...

2012
Abdollah Khodkar

A Roman dominating function of a graph G is a labeling f : V (G) −→ {0, 1, 2} such that every vertex with label 0 has a neighbor with label 2. The Roman domination number γR(G) of G is the minimum of ∑ v∈V (G) f(v) over such functions. The Roman domination subdivision number sdγR(G) is the minimum number of edges that must be subdivided (each edge in G can be subdivided at most once) in order t...

2015
LINFENG XU

In his article published in 1999, Ian Stewart discussed a strategy of Emperor Constantine for defending the Roman Empire. Motivated by this article, Cockayne et al.(2004) introduced the notion of Roman domination in graphs. Let G = (V,E) be a graph. A Roman dominating function of G is a function f : V → {0, 1, 2} such that every vertex v for which f(v) = 0 has a neighbor u with f(u) = 2. The we...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید