Results 21 to 30 of about 1,362,273 (352)
Sugars dominate the seagrass rhizosphere
Seagrasses are among the most efficient sinks of carbon dioxide on Earth. While carbon sequestration in terrestrial plants is linked to the microorganisms living in their soils, the interactions of seagrasses with their rhizospheres are poorly understood.
E. Sogin +12 more
semanticscholar +1 more source
α-cyanobacteria possessing form IA RuBisCO globally dominate aquatic habitats
RuBisCO (ribulose 1,5-bisphosphate carboxylase/oxygenase) is one the most abundant enzymes on Earth. Virtually all food webs depend on its activity to supply fixed carbon.
Pedro J. Cabello‐Yeves +15 more
semanticscholar +1 more source
Dominating Sets and Domination Polynomials of Paths [PDF]
Let G = (V, E) be a simple graph. A set S⊆V is a dominating set of G, if every vertex in V\S is adjacent to at least one vertex in S. Let be the family of all dominating sets of a path Pn with cardinality i, and let . In this paper, we construct , and obtain a recursive formula for d(Pn, i).
Saeid Alikhani, Yee-Hock Peng
openaire +2 more sources
Iron colloids dominate sedimentary supply to the ocean interior
Significance Phytoplankton assimilate carbon dioxide, produce oxygen, and nourish food webs on a scale that impacts planetary processes but are limited by iron deficiency over much of the global surface ocean. Therefore, we must understand processes that
W. Homoky +6 more
semanticscholar +1 more source
Domination and Fractional Domination in Digraphs
In this paper, we investigate the relation between the (fractional) domination number of a digraph $G$ and the independence number of its underlying graph, denoted by $\alpha(G)$. More precisely, we prove that every digraph $G$ on $n$ vertices has fractional domination number at most $2\alpha(G)$ and domination number at most $2\alpha(G) \cdot \log{n}$.
Harutyunyan, Ararat +3 more
openaire +5 more sources
In this paper, we propose a new network reliability measure for some particular kind of service networks, which we refer to as domination reliability. We relate this new reliability measure to the domination polynomial of a graph and the coverage probability of a hypergraph.
Klaus Dohmen, Peter Tittmann 0001
openaire +3 more sources
Domination in functigraphs [PDF]
Let $G_1$ and $G_2$ be disjoint copies of a graph $G$, and let $f: V(G_1) \rightarrow V(G_2)$ be a function. Then a \emph{functigraph} $C(G, f)=(V, E)$ has the vertex set $V=V(G_1) \cup V(G_2)$ and the edge set $E=E(G_1) \cup E(G_2) \cup \{uv \mid u \in V(G_1), v \in V(G_2), v=f(u)\}$.
Linda Eroh +4 more
openaire +3 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
Secretory Cells Dominate Airway CFTR Expression and Function in Human Airway Superficial Epithelia.
RATIONALE Identification of the specific cell types expressing CFTR is required for precision medicine therapies for cystic fibrosis (CF). However, a full characterization of CFTR expression in normal human airway epithelia is missing.
K. Okuda +30 more
semanticscholar +1 more source
Relating domination, exponential domination, and porous exponential domination
The domination number $γ(G)$ of a graph $G$, its exponential domination number $γ_e(G)$, and its porous exponential domination number $γ_e^*(G)$ satisfy $γ_e^*(G)\leq γ_e(G)\leq γ(G)$. We contribute results about the gaps in these inequalities as well as the graphs for which some of the inequalities hold with equality.
Michael A. Henning +2 more
openaire +3 more sources

