Results 11 to 20 of about 44,708 (295)
Domination, Eternal Domination, and Clique Covering
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
Relating 2-Rainbow Domination To Roman Domination
For a graph G, let R(G) and yr2(G) denote the Roman domination number of G and the 2-rainbow domination number of G, respectively. It is known that yr2(G) ≤ R(G) ≤ 3/2yr2(G). Fujita and Furuya [Difference between 2-rainbow domination and Roman domination
Alvarado José D. +2 more
doaj +3 more sources
Domination versus edge domination [PDF]
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
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
Violence has become a common phenomenon that affects women and children, particularly during the coronavirus disease 2019 (COVID-19) pandemic. While the lockdown regulations were meant to save lives by preventing further spread of the virus, another ...
Tshenolo J. Madigele, Gift T. Baloyi
doaj +1 more source
Relating domination, exponential domination, and porous exponential domination
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
Graphs with equal domination and certified domination numbers [PDF]
A set \(D\) of vertices of a graph \(G=(V_G,E_G)\) is a dominating set of \(G\) if every vertex in \(V_G-D\) is adjacent to at least one vertex in \(D\). The domination number (upper domination number, respectively) of \(G\), denoted by \(\gamma(G)\) (\(\
Magda Dettlaff +5 more
doaj +1 more source
Dominating vertex covers: the vertex-edge domination problem [PDF]
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
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
Iterated weak dominance and subgame dominance [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +5 more sources

