This article contributes to the broadening agenda of critical globalisation(s) research by analysing one of the most fundamental ideological foundations of the current global transformation in a historical perspective: the ideology of "domination over nature" that was implemented in Europe from 1500 onwards. Humans have always shaped and altered their environment according to their needs and as...

In this paper, we propose a new network reliability measure for some particular kind of service networks, which we refer to as domination reliability. We relate this new reliability measure to the domination polynomial of a graph and the coverage probability of a hypergraph. We derive explicit and recursive formulæ for domination reliability and its associated domination reliability polynomial,...

for a graph $g$ let $gamma (g)$ be its domination number. we define a graph g to be (i) a hypo-efficient domination graph (or a hypo-$mathcal{ed}$ graph) if $g$ has no efficient dominating set (eds) but every graph formed by removing a single vertex from $g$ has at least one eds, and (ii) a hypo-unique domination graph (a hypo-$mathcal{ud}$ graph) if $g$ has at least two minimum dominating sets...

the broadcast domination number of the cartesian product of two cycles is completely determined.

A dominating set S of a graph G is called efficient if |N [v]∩S| = 1 for every vertex v ∈ V (G). That is, a dominating set S is efficient if and only if every vertex is dominated exactly once. In this paper, we investigate efficient multiple domination. There are several types of multiple domination defined in the literature: k-tuple domination, {k}-domination, and k-domination. We investigate ...

This paper consists of two loosely related notes on the domination number of graphs. In the first part, we provide a new upper bound for the domination number of d-regular graphs. Our bound is the best known for d ≥ 6. In the second part, we compute the exact domination number and total domination number of certain Kneser graphs, and we provide some bounds on the domination number of other Knes...

This paper examines power structures that make E-Commerce adoption amongst Small and Medium Enterprises in least developing countries a daunting task. The study adopts structuration theory as a lens, focusing specifically on structures of domination. The results indicate that at organizational level, lack of management support was the reason. However this was caused by government’s reluctance t...

This study aims to explore Turkish citizen-consumers' understanding of and reactions to censorship of websites in Turkey by using in-depth interviews and online ethnography. In an environment where sites such as YouTube and others are increasingly being banned, the citizen-consumers' macro-level understanding is that such censorship is part of a wider ideological plan and their micro-level unde...

Upper and lower bounds on the total domination number of the direct product of graphs are given. The bounds involve the {2}-total domination number and the total 2-tuple domination number of the factors. Using these relationships some exact total domination numbers are obtained. An infinite family of graphs is constructed showing that the bounds are best possible. The domination number of direc...