Results 11 to 20 of about 636,705 (281)
Domination, Eternal Domination, and Clique Covering
Discussiones Mathematicae Graph Theory, 2015 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-
Klostermeyer William F., Mynhardt C.M.
doaj +3 more sources
Domination versus edge domination [PDF]
Discrete Applied Mathematics, 2020 We propose the conjecture that the domination number $ (G)$ of a $ $-regular graph $G$ with $ \geq 1$ is always at most its edge domination number $ _e(G)$, which coincides with the domination number of its line graph. We prove that $ (G)\leq \left(1+\frac{2( -1)}{ 2^ }\right) _e(G)$ for general $ \geq 1$, and $ (G)\leq \left(\frac{7}{6 ...
Baste, Julien +4 more
openaire +2 more sources
The Electronic Journal of Combinatorics, 2012 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.
Dohmen, Klaus, Tittmann, Peter
openaire +3 more sources
Secrétaires et policiers ? Les assistant·es d’éducation et leurs appropriations d’un travail dominé
La Nouvelle Revue du Travail, 2022 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
The domination number of on-line social networks and random geometric graphs [PDF]
, 2014 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]
, 2018 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
Relating domination, exponential domination, and porous exponential domination
Discrete Optimization, 2017 The domination number $ (G)$ of a graph $G$, its exponential domination number $ _e(G)$, and its porous exponential domination number $ _e^*(G)$ satisfy $ _e^*(G)\leq _e(G)\leq (G)$. We contribute results about the gaps in these inequalities as well as the graphs for which some of the inequalities hold with equality.
Henning, Michael A. +2 more
openaire +3 more sources
Le libéralisme, combien de divisions ?
Astérion, 2022 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
Mill and Pettit on Freedom, Domination, and Freedom-as-Domination [PDF]
, 2019 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
Dominating vertex covers: the vertex-edge domination problem [PDF]
Discussiones Mathematicae Graph Theory, 2021 A variant of domination, namely, vertex-edge domination in which a set of vertices dominating the edges is studied. The vertex-edge domination number of a graph \(G\), \(\gamma_{\mathrm{ve}}(G)\), is defined to be the cardinality of a smallest set \(D\) such that there exists a vertex cover \(C\) of \(G\) such that each vertex in \(C\) is dominated by ...
Klostermeyer, William F. +2 more
openaire +3 more sources