Results 211 to 220 of about 72,011 (256)
Boosting the Performance of Epitaxial Perovskite Microstructures by Surface Passivation
Surface passivation is applied to epitaxial perovskite structures. Improvements are obtained in respect to luminescence intensity and decay time, as well in respect to photodetection and lasing. Highlight results include photoluminescence transients that are limited only by carrier diffusion and a record low laser threshold for microcrystal‐based ...
Shuyu Zhou +19 more
wiley +1 more source
Single‐Cell Insights Into Macrophage Subtypes in Pulmonary Infections
This review highlights the dynamic plasticity of macrophages during pulmonary infections and proposes an integrative framework defining six functional subtypes: Inflam‐Ms, Hub‐Ms, Reg‐Ms, Prolif‐Ms, Memory‐Ms, and Senesc‐Ms. Single‐cell omics delineate their distinct roles in homeostasis and infection, refining our understanding of macrophage ...
Zhaoheng Lin +3 more
wiley +1 more source
Transition‐Metal‐Free Zeolite Composites for Tandem Catalytic Conversion of Methane to Light Olefins
Light olefins can be produced from methane using a cascade catalytic system that combines transition‐metal‐free (FER zeolite with an acidic zeolite, such as SAPO‐34, under relatively mild conditions. In this tandem process, methane is first oxidized to methanol over the FER zeolite and then converted to olefins via the MTO reaction on the acidic ...
Peipei Xiao +5 more
wiley +1 more source
DOUBLE ROMAN DOMINATION NUMBER OF MIDDLE GRAPH
For any graph G(V, E), a function f : V (G) 0, 1, 2, 3 is called Double Roman dominating function (DRDF) if the following properties holds, If f (v) = 0, then there exist two vertices v1, v2 ∈ N (v) for which f (v1) = f (v2) = 2 or there exist one vertex u ∈ N (v) for which f (u) = 3.∈ If f (v) = 1, then there exist one vertex u N (v) for which
Shirkol, Shailaja S. +2 more
openaire +4 more sources
Double Roman domination subdivision number in graphs
For a graph [Formula: see text], a double Roman dominating function is a function [Formula: see text] having the property that if [Formula: see text], then vertex [Formula: see text] must have at least two neighbors assigned [Formula: see text] under [Formula: see text] or one neighbor with [Formula: see text], and if [Formula: see text], then vertex [
Amjadi, J., Sadeghi, H.
openaire +3 more sources
An Upper Bound on the Double Roman Domination Number
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ouldrabah, Lyes, Volkmann, Lutz
openaire +2 more sources
Trees with Double Roman Domination Number Twice the Domination Number Plus Two
A double Roman dominating function (DRDF) on a graph $$G=(V,E)$$ is a function $$f:V(G)\rightarrow \{0,1,2,3\}$$
H. Abdollahzadeh Ahangar +4 more
openaire +2 more sources
Double Roman domination number
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Anu V., Aparna Lakshmanan S.
openaire +3 more sources
New bounds on the outer-independent total double Roman domination number
A double Roman dominating function (DRDF) on a graph [Formula: see text] is a function [Formula: see text] satisfying (i) if [Formula: see text] then there must be at least two neighbors assigned two under [Formula: see text] or one neighbor [Formula: see text] with [Formula: see text]; and (ii) if [Formula: see text] then [Formula: see text] must be ...
S. M. Sheikholeslami, L. Volkmann
openaire +3 more sources

