Results 31 to 40 of about 1,161 (229)
On the complexity of some hop domination parameters
A hop Roman dominating function (HRDF) on a graph G = (V, E) is a function f : V → {0, 1, 2} having the property that for every vertex v ∈ V with f(v) = 0 there is a vertex u with f(u) = 2 and d(u, v) = 2. The weight of an HRDF f is the sum of its values
Nader Jafari Rad, Elahe Shabani
doaj +1 more source
All‐epitaxial and scalable ferromagnetic/non‐magnetic Fe5−xGeTe2/WSe2 van der Waals (vdW) heterostructures exhibiting room‐temperature magnetism and perpendicular magnetic anisotropy (PMA) are realized. The system displays proximity‐tuned magnetic anisotropy, thickness‐dependent unconventional Hall effects, and temperature‐dependent sign reversal of ...
Hua Lv +15 more
wiley +1 more source
Molecular Basis of NPY Recognition and Ligand Selectivity at the Neuropeptide Y5 Receptor
Here, we present the first active structure of the neuropeptide Y5 receptor (NPY5R) in complex with its endogenous ligand NPY and the Gi1 protein. The cryo‐electron microscopy structure, validated by extensive mutagenesis studies, gives important insights into the molecular mechanisms underlying ligand binding and receptor activation.
Lisa Christin Peuker +8 more
wiley +2 more sources
The Distance Roman Domination Numbers of Graphs
Let k be a positive integer, and let G be a simple graph with vertex set V (G). A k-distance Roman dominating function on G is a labeling f : V (G) → {0, 1, 2} such that for every vertex with label 0, there is a vertex with label 2 at distance at most k ...
Aram Hamideh +2 more
doaj +1 more source
The Double Roman Domatic Number of a Digraph
A double Roman dominating function on a digraph D with vertex set V (D) is defined in [G. Hao, X. Chen and L. Volkmann, Double Roman domination in digraphs, Bull. Malays. Math. Sci. Soc. (2017).] as a function f : V (D) → {0, 1, 2, 3} having the property
Volkmann Lutz
doaj +1 more source
Total double Roman domination in graphs [PDF]
Let $G$ be a simple graph with vertex set $V$. A double Roman dominating function (DRDF) on $G$ is a function $f:V\rightarrow\{0,1,2,3\}$ satisfying that if $f(v)=0$, then the vertex $v$ must be adjacent to at least two vertices assigned $2$ or one ...
Guoliang Hao +2 more
doaj +1 more source
A mechano‐triggered polythiourethane (PTU) synthesis mediated by a two‐electron pathway. The polymerization proceeds efficiently (<1 h) under focused ultrasound, achieving >90% conversion without any conventional base catalyst. The approach demonstrates broad compatibility with various thiol/isocyanate monomer combinations, highlighting its synthetic ...
Yixiao Dong +7 more
wiley +2 more sources
By integrating 516 whole‐genome resequencing datasets and 236 transcriptomes of allotetraploid common carp, this study establishes the first population‐scale atlas of transposable element (TE) variation in teleost species. TE bursts, relaxed purifying selection, and lineage‐specific loss of ancient insertions shape genome evolution and phenotypic ...
Shuimu Hu +11 more
wiley +1 more source
Guest transport across metal–organic framework (MOF) single crystals disentangles transport occurring through the micropores from contributions at grain boundaries. Even guest molecules with identical kinetic diameters show drastically different transport behavior arising from the distinct modes of adsorption. Neither pore clogging nor surface collapse
Hochul Woo +2 more
wiley +2 more sources
On outer-convex Roman dominating function in graphs
Let \(G = (V(G), E(G))\) be a connected graph and let \(\phi:V(G)\rightarrow \{0,1,2\}\) be a Roman dominating function (RDF) on \(G\). For each \(j \in \{0, 1, 2\}\), let \(V_j=\{x \in V(G): \phi(x)=j\}\).
Leomarich Casinillo
doaj +1 more source

