Results 221 to 230 of about 5,633 (238)

All-boron analogue of planar benzene on an osmium template. [PDF]

Chem Sci
Kar K, Joshi G, Jemmis ED, Ghosh S.
europepmc   +1 more source

Reproductive coercion, medical mistrust, and Black women's health from the antebellum period to the 21^st century. [PDF]

Int J Equity Health
Adekunle TE.
europepmc   +1 more source

Global Fields and Migration Regimes: Citizenship by Investment. [PDF]

Br J Sociol
Surak K.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Kenyan dominance in distance running

Comparative Biochemistry and Physiology Part A: Molecular & Integrative Physiology, 2003
Critical physiological factors for performance in running are maximal oxygen consumption (VO(2max)), fractional VO(2max) utilization and running economy. While Kenyan and Caucasian elite runners are able to reach very high, but similar maximal oxygen uptake levels, the VO(2max) of black South African elite runners seems to be slightly lower.
openaire   +2 more sources

Paired-Domination Problem on Distance-Hereditary Graphs

Algorithmica, 2020
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lin, Ching-Chi, Ku, Keng-Chu, Hsu, Chan-Hung   +2 more
openaire   +2 more sources

Distance Domination in Graphs

2020
For an integer k ≥ 1, a (distance) k-dominating set of a connected graph G is a set S of vertices of G such that every vertex of V (G) ∖ S is at distance at most k from some vertex of S. The k-domination number, γk(G), of G is the minimum cardinality of a k-dominating set of G. In this chapter, we survey selected results on the k-domination number of a
openaire   +1 more source

2-Distance paired-dominating number of graphs

Journal of Combinatorial Optimization, 2013
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yu, Kan, Lu, Mei
openaire   +1 more source

Short-distance dominance of vertex functions

Physical Review D, 1975
In order to calculate high-energy high-momentum-transfer processes for particles described by composite fields one needs to know some uniformity properties of the external-particle vertex function. We examine such a vertex function in a scalar theory in six dimensions in the case in which anomalous dimensions are realized. We start from the result that,
openaire   +2 more sources

On distance-s locating and distance-t dominating sets in graphs

Discrete Mathematics, Algorithms and Applications, 2023
Let [Formula: see text] and [Formula: see text] be positive integers, and let [Formula: see text] be a simple and connected graph with vertex set [Formula: see text]. For [Formula: see text], let [Formula: see text] denote the length of an [Formula: see text] geodesic in [Formula: see text] and let [Formula: see text]. Let [Formula: see text].
openaire   +2 more sources

Distance-Hereditary Graphs, Steiner Trees, and Connected Domination

SIAM Journal on Computing, 1988
Summary: Distance-hereditary graphs have been introduced by Howorka and studied in the literature with respect to their metric properties. In this paper several equivalent characterizations of these graphs are given: in terms of existence of particular kinds of vertices (isolated, leaves, twins) and in terms of properties of connections, separators ...
A. D'Atri, MOSCARINI, Marina
openaire   +4 more sources