Results 231 to 240 of about 200,043 (266)
Some of the next articles are maybe not open access.
2019
Inspired by the feedback scenario, which characterizes online social networks, we introduce a novel domination problem, which we call Dual Domination (DD). We assume that the nodes in the input network are partitioned into two categories: Positive nodes (V+) and negative nodes (V-).
Cordasco G., Gargano L., Rescigno A. A.
openaire +3 more sources
Inspired by the feedback scenario, which characterizes online social networks, we introduce a novel domination problem, which we call Dual Domination (DD). We assume that the nodes in the input network are partitioned into two categories: Positive nodes (V+) and negative nodes (V-).
Cordasco G., Gargano L., Rescigno A. A.
openaire +3 more sources
A note on domination and total domination in prisms
Journal of Combinatorial Optimization, 2017Let \(G=(V,E)\) be a simple graph. A subset \(S \subseteq V\) is a dominating set if every vertex \(v \in V\setminus S\) is adjacent to a vertex in S. The minimum cardinality of a dominating set, denoted by \(\gamma(G)\), called the domination number of graph \(G\).
Wayne Goddard, Michael A. Henning
openaire +2 more sources
, 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.
openaire +1 more source
Double domination and super domination in trees
Discrete Mathematics, Algorithms and Applications, 2016A vertex of a graph [Formula: see text] is said to dominate itself and all its neighbors. A double dominating set (DDS) of a graph [Formula: see text] is a set [Formula: see text] of vertices such that every vertex of [Formula: see text] is dominated by at least two vertices of [Formula: see text]. The double domination number of a graph [Formula: see
B. Krishnakumari +1 more
openaire +1 more source
Domination and total domination in complementary prisms
Journal of Combinatorial Optimization, 2008zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Teresa W. Haynes +2 more
openaire +2 more sources
Developmental Medicine & Child Neurology, 1972
SUMMARYLaterality, hand preference and cerebral dominance are terms which are often used synonymously. They should be differentiated, however. A review of the literature demonstrates much (often eclectic) knowledge which is often not directly applicable clinically.
openaire +3 more sources
SUMMARYLaterality, hand preference and cerebral dominance are terms which are often used synonymously. They should be differentiated, however. A review of the literature demonstrates much (often eclectic) knowledge which is often not directly applicable clinically.
openaire +3 more sources
A Comparison of Dominant and Non-Dominant Hand Strengths
Journal of Hand Surgery, 1999This study compares dominant and non-dominant hand strength in both right- and left-handed participants. Maximum voluntary contraction (MVC) of the first dorsal interosseous (FDI) muscle, power grip strength and pulp-to-pulp pinch strength were assessed under carefully controlled conditions. No significant differences were observed between dominant and
Oldham, Jacqueline +2 more
openaire +2 more sources
Trees with Equal Domination and Restrained Domination Numbers
Journal of Global Optimization, 2006zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Peter Dankelmann +3 more
openaire +1 more source
Domination and edge-vertex domination in trees
Discrete Mathematics, Algorithms and ApplicationsLet [Formula: see text] be a simple connected graph. An edge [Formula: see text] [Formula: see text]-dominates a vertex [Formula: see text] if [Formula: see text] is incident with [Formula: see text] or [Formula: see text] is incident with a vertex adjacent to [Formula: see text].
openaire +1 more source