Results 11 to 20 of about 715,404 (258)
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
Maker-Breaker domination number [PDF]
, 2019 The Maker-Breaker domination game is played on a graph $G$ by Dominator and Staller. The players alternatively select a vertex of $G$ that was not yet chosen in the course of the game.
Gledel, Valentin +2 more
core +2 more sources
Self-resonance after inflation: Oscillons, transients, and radiation domination [PDF]
, 2017 Homogeneous oscillations of the inflaton after inflation can be unstable to small spatial perturbations even without coupling to other fields. We show that for inflaton potentials $\ensuremath{\propto}|\ensuremath{\phi}{|}^{2n}$ near $|\ensuremath{\phi}|=
K. Lozanov, M. Amin
semanticscholar +1 more source
Iterated weak dominance and subgame dominance [PDF]
Journal of Mathematical Economics, 2005 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +5 more sources
Current Biology, 2017 Barbier et al. give a quick guide to apical dominance, whereby a plant's main shoot dominates and inhibits the outgrowth of other shoots.
Barbier, Francois F. +2 more
openaire +3 more sources
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
The Capitalist Cage: Structural Domination and Collective Agency in the Market
Journal of Applied Philosophy, 2020 textabstractThis article develops and defends a triadic account of structural domination, according to which structural domination (e.g. patriarchy, white supremacy, capitalism) is a triadic relation between dominator(s), dominated, and regulator(s)—the ...
N. Vrousalis
semanticscholar +1 more source
Independent domination versus weighted independent domination [PDF]
Information Processing Letters, 2020 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lozin V. +3 more
openaire +5 more sources
Partial domination of maximal outerplanar graphs [PDF]
Discrete Applied Mathematics, 2019 Several domination results have been obtained for maximal outerplanar graphs (mops). The classical domination problem is to minimize the size of a set $S$ of vertices of an $n$-vertex graph $G$ such that $G - N[S]$, the graph obtained by deleting the ...
P. Borg, P. Kaemawichanurat
semanticscholar +1 more source