Results 21 to 30 of about 623,562 (309)
Dominance and Monopolization [PDF]
This indispensable Handbook examines both economic and legal aspects of competition policy and industrial organization. It provides a scholarly review of the state of the art regarding economic theory, empirical evidence and standards of legal evaluation.
Canoy, Marcel +2 more
openaire +8 more sources
Secrétaires et policiers ? Les assistant·es d’éducation et leurs appropriations d’un travail dominé
The article highlights the dominated position that French secondary school supervisors assume in the division of educational work. It does this by analysing the content of their tasks as well as the different ways in which they appropriate it ...
Géraldine Bois, Rémi Deslyper
doaj +1 more source
Domination and Fractional Domination in Digraphs
In this paper, we investigate the relation between the (fractional) domination number of a digraph $G$ and the independence number of its underlying graph, denoted by $\alpha(G)$. More precisely, we prove that every digraph $G$ on $n$ vertices has fractional domination number at most $2\alpha(G)$ and domination number at most $2\alpha(G) \cdot \log{n}$.
Harutyunyan, Ararat +3 more
openaire +5 more sources
Let be a graph and let be a family of subsets of such that A dominating set of is called an -dominating set if for all The minimum cardinality of an -dominating of is called the -domination number of and is denoted by In this paper we present several ...
Manju Raju +3 more
doaj +1 more source
Le libéralisme, combien de divisions ?
Liberalism is a very broad political family which, if taken in the broadest sense, brings together authors with diverse positions whose only common point is their attachment to freedom.
Bernard Quiriny
doaj +1 more source
Weak signed Roman domination in graphs [PDF]
A weak signed Roman dominating function (WSRDF) of a graph $G$ with vertex set $V(G)$ is defined as a function $f:V(G)\rightarrow\{-1,1,2\}$ having the property that $\sum_{x\in N[v]}f(x)\ge 1$ for each $v\in V(G)$, where $N[v]$ is the closed ...
Lutz Volkmann
doaj +1 more source
Hypo-efficient domination and hypo-unique domination
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 ...
V. Samodivkin
doaj +1 more source
Mill and Pettit on Freedom, Domination, and Freedom-as-Domination [PDF]
Pettit endorses a ‘republican’ conception of social freedom of the person as consisting of a state of non-domination, and takes this to refute Mill’s ‘liberal’ claim that non-domineering but coercive interference can compromise social freedom of choice ...
Beaumont, Tim
core +2 more sources
The domination number of on-line social networks and random geometric graphs [PDF]
We consider the domination number for on-line social networks, both in a stochastic network model, and for real-world, networked data. Asymptotic sublinear bounds are rigorously derived for the domination number of graphs generated by the memoryless ...
Bonato, Anthony +4 more
core +4 more sources
Domination parameters with number 2: Interrelations and algorithmic consequences [PDF]
In this paper, we study the most basic domination invariants in graphs, in which number 2 is intrinsic part of their definitions. We classify them upon three criteria, two of which give the following previously studied invariants: the weak 2-domination ...
Bonomo, Flavia +4 more
core +2 more sources

