Results 11 to 20 of about 1,480,823 (289)
, 2008 The concept of stochastic dominance is defined, and its relation to welfare, poverty, and income inequality explained. A brief discussion is provided of how statistical inference may be performed for hypotheses relating to stochastic dominance.
Russell Davidson
core +2 more sources
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
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
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
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
Domination, eternal domination and clique covering
Discussiones Mathematicae Graph Theory, 2015 16 pages, 3 ...
Klostermeyer William F., Mynhardt C.M.
openaire +3 more sources
Arboreal twig-nesting ants form dominance hierarchies over nesting resources. [PDF]
, 2019 Interspecific dominance hierarchies have been widely reported across animal systems. High-ranking species are expected to monopolize more resources than low-ranking species via resource monopolization. In some ant species, dominance hierarchies have been
Philpott, Stacy M, Yitbarek, Senay
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
Biology, 2022 In most animals, males are considered more aggressive, in terms of frequency and intensity of aggressive behaviors, than their female peers. However, in several species this widespread male-biased aggression pattern is either extenuated, absent, or even ...
Ruth Sonnweber +4 more
doaj +1 more source