Results 41 to 50 of about 738,356 (324)
Domination Parameters of a Graph and its Complement
Discussiones Mathematicae Graph Theory, 2018 A dominating set in a graph G is a set S of vertices such that every vertex in V (G) \ S is adjacent to at least one vertex in S, and the domination number of G is the minimum cardinality of a dominating set of G.
Desormeaux Wyatt J. +2 more
doaj +1 more source
Coloring, location and domination of corona graphs [PDF]
, 2012 A vertex coloring of a graph $G$ is an assignment of colors to the vertices of $G$ such that every two adjacent vertices of $G$ have different colors. A coloring related property of a graphs is also an assignment of colors or labels to the vertices of a ...
Aguilar, A. Rondón +2 more
core +4 more sources
Discussiones Mathematicae Graph Theory, 2005 Summary: For a finite undirected graph \(G\) on \(n\) vertices two continuous optimization problems taken over the \(n\)-dimensional cube are presented and it is proved that their optimum values equal the domination number \(\gamma\) of \(G\). An efficient approximation method is developed and known upper bounds on \(\gamma\) are slightly improved.
Frank Göring, Jochen Harant
openaire +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
Actual Problems of Economics and Law, 2015 Objective: to revisit the debate about rational choice theory from the legal, cultural and historical perspectives.Methods: dialectic approach to the cognition of social phenomena, allowing to analyze them in their historical development and functioning in the context of the integrity of subjective and objective factors; this determines the choice of ...
openaire +2 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
On Independence Domination [PDF]
, 2013 Let G be a graph. The independence-domination number is the maximum over all independent sets I in G of the minimal number of vertices needed to dominate I. In this paper we investigate the computational complexity of independence domination for graphs in several graph classes related to cographs. We present an exact exponential algorithm.
Wing-Kai Hon +4 more
openaire +2 more sources
, 2019 Let M be a compact oriented even-dimensional manifold. This note constructs a compact symplectic manifold S of the same dimension and a map f from S to M of strictly positive degree.
Fine, Joel, Panov, Dmitri
core +1 more source
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