Results 21 to 30 of about 577,930 (304)
Hereditary equality of domination and exponential domination
We characterize a large subclass of the class of those graphs $G$ for which the exponential domination number of $H$ equals the domination number of $H$ for every induced subgraph $H$ of $G$.
Michael A. Henning +2 more
openaire +4 more sources
DOMINATION AND REGULARITY [PDF]
AbstractWe discuss the close relationship between structural theorems in (generalized) stability theory, and graph regularity theorems.
openaire +3 more sources
Prestige and dominance-based hierarchies exist in naturally occurring human groups, but are unrelated to task-specific knowledge [PDF]
Prestige and dominance are thought to be two evolutionarily distinct routes to gaining status and influence in human social hierarchies. Prestige is attained by having specialist knowledge or skills that others wish to learn, whereas dominant individuals
C. O. Brand, A. Mesoudi
doaj +1 more source
Half Diallel Analysis and Heat Stress Tolerance Indices for Grain Yield in Bread Wheat [PDF]
Heterosis and combining ability were determined in bread wheat using 6 x 6 half diallel analysis under normal and late planting dates during seasons 2019/2020 and 2020/2021 at Al-Matana Agricultural Research Station, Agricultural Research Center, Luxor ...
H. Fouad +4 more
doaj +1 more source
Domination, eternal domination and clique covering
16 pages, 3 ...
William F. Klostermeyer +1 more
openaire +4 more sources
Market Power and the GDPR: Can Consent Given to Dominant Companies Ever Be Freely Given?
(Series Information) European Papers - A Journal on Law and Integration, 2023 8(2), 611-629 | Article | (Table of Contents) I. Introduction. – II. The Facebook case. – II.1. Case overview. – II.2. The opinion of the AG. – III. Dominance for GDPR purposes.
Alessia Sophia D'Amico
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
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 +3 more sources
On Independence Domination [PDF]
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 +4 more sources
Dominance solvability of dynamic bargaining games [PDF]
Backward induction, Coalition, Core, Weak dominance, C78, D71, D74,
Christopher Tyson +2 more
core +1 more source

