Results 1 to 10 of about 715,404 (258)
DOMINATION AND EDGE DOMINATION IN TREES [PDF]
Ural Mathematical Journal, 2020 Let \(G=(V,E)\) be a simple graph. A set \(S\subseteq V\) is a dominating set if every vertex in \(V \setminus S\) is adjacent to a vertex in \(S\). The domination number of a graph \(G\), denoted by \(\gamma(G)\) is the minimum cardinality of a dominating set of \(G\). A set \(D \subseteq E\) is an edge dominating set if every edge in \(E\setminus D\)
B. Senthilkumar +2 more
openaire +4 more sources
Algorithmic domination in the gig economy
European Journal of Political Theory, 2022 Digital platforms and application software have changed how people work in a range of industries. Empirical studies of the gig economy have raised concerns about new systems of algorithmic management exercised over workers and how these alter the ...
James Muldoon, P. Raekstad
semanticscholar +1 more source
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 case for epistocratic republicanism [PDF]
, 2020 In recent years, the fortunes of democracy have waned both in theory and practice. This has added impetus not only to the republican case for strengthening democratic institutions but also to new anti-democratic thought.
Blunt, G. D.
core +1 more source
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
Upper paired domination versus upper domination [PDF]
Discrete Mathematics & Theoretical Computer Science, 2021 A paired dominating set $P$ is a dominating set with the additional property that $P$ has a perfect matching. While the maximum cardainality of a minimal dominating set in a graph $G$ is called the upper domination number of $G$, denoted by $\Gamma(G)$, the maximum cardinality of a minimal paired dominating set in $G$ is called the upper paired ...
Alizadeh, Hadi, Gözüpek, Didem
openaire +5 more sources
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
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
Varieties of Roman domination II
AKCE Int. J. Graphs Comb., 2020 In this work, we continue to survey what has been done on the Roman domination. More precisely, we will present in two sections several variations of Roman dominating functions as well as the signe...
M. Chellali +3 more
semanticscholar +1 more source
Domination, eternal domination and clique covering
Discussiones Mathematicae Graph Theory, 2015 16 pages, 3 ...
Klostermeyer William F., Mynhardt C.M.
openaire +3 more sources