The hegemonic-type empires of ancient Mesoamerica are difficult to study archaeologically because they left fewer material traces than more territorially organized empires such as the Inka or Roman cases. We present a material culture model for the identification of such empires using archaeological data. The model, based upon Michael Doyle’s analytical approach to imperialism, is developed fro...

L’image de la femme îlienne a souvent été associée à des stéréotypes réducteurs représentant dans une position victime battue, maltraitée et exploitée. Pour se démarquer cette représentation, l’auteur Nassur Attoumani propose nouvelle approche en dépeignant insulaire contemporaine sous nouveaux jours le roman Mon mari est plus qu’un fou : c’est un homme. Cette étude montre comment après s’être ...

We consider two general frameworks for multiple domination, which are called 〈r, s〉-domination and parametric domination. They generalise and unify {k}-domination, k-domination, total k-domination and k-tuple domination. In this paper, known upper bounds for the classical domination are generalised for the 〈r, s〉-domination and parametric domination numbers. These generalisations are based on t...

Eternal and m-eternal domination are concerned with using mobile guards to protect a graph against infinite sequences of attacks at vertices. Eternal domination allows one guard to move per attack, whereas more than one guard may move per attack in the m-eternal domination model. Inequality chains consisting of the domination, eternal domination, m-eternal domination, independence, and clique c...

Many graph domination applications can be expanded to achieve complete cototal domination. If every node in a dominating set is regarded as record server for PC organization, then each affiliated with the organization has direct access document server. It occasionally reasonable believe that this gateway will remain available even if one of scrape servers fails. Because at least two documents’ ...

For a graph [Formula: see text], double Roman dominating function (DRDF) is text] having the property that if for some vertex then has at least two neighbors assigned under or one neighbor with and text]. The weight of DRDF sum minimum on domination number denoted by bondage cardinality among all edge subsets such In this paper, we study in graphs. We determine several families graphs, present ...

BackgroundGame Theory Interpretation MethodsRandomizationFunctional Lagrange Multipliers ConclusionsReferences