Results 201 to 210 of about 73,869 (254)
Partial Entrance Restriction as a Potential Tidal Flood Mitigation Strategy in a Large Urban Estuary
Journal of Flood Risk Management, Volume 19, Issue 2, June 2026.ABSTRACT Tidal flooding in estuaries is expected to worsen as sea‐level rise (SLR) continues to accelerate and increases storm surge height. Conventional structural defences are often unsustainable, while nature‐based solutions like managed realignment require extensive land to be repurposed.
Octria A. Prasojo +4 more
wiley +1 more source
Climate Change Agricultural Comparative Advantage and the US Trade Balance
Applied Economic Perspectives and Policy, Volume 48, Issue 2, Page 473-486, May 2026.ABSTRACTCurrent science indicates that warming and elevated atmospheric CO2 will have ambiguous results for crop productivity depending on crop type and geographic location, whereas increased heat stress makes livestock and human labor less productive.
Elizabeth A. Fraysse +2 more
wiley +1 more source
Christian Bohr. Discoverer of Homotropic and Heterotopic Allostery: Periods Leading up to Bohr's Life, Work, and Beyond. Was Bohr a Vitalist and Right About a "Specific Activity"? [PDF]
Acta Physiol (Oxf)Bindslev N.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Total double Roman domination numbers in digraphs
Discrete Mathematics, Algorithms and Applications, 2021Let [Formula: see text] be a finite and simple digraph with vertex set [Formula: see text]. A double Roman dominating function (DRDF) on digraph [Formula: see text] is a function [Formula: see text] such that every vertex with label 0 has an in-neighbor with label 3 or two in-neighbors with label 2 and every vertex with label 1 have at least one in ...
Amjadi, J., Pourhosseini, F.
openaire +3 more sources
New bounds on the outer-independent total double Roman domination number
Discrete Mathematics, Algorithms and Applications, 2023A 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
Algorithmic Aspects of Total Roman and Total Double Roman Domination in Graphs
International Conference on Algorithms and Discrete Applied Mathematics, 2021For a simple, undirected and connected graph \(G = (V, E)\), a total Roman dominating function (TRDF) \(f : V \rightarrow \lbrace 0, 1, 2 \rbrace \) has the property that, every vertex u with \(f(u) = 0\) is adjacent to at least one vertex v for which \(f(v) = 2\) and the subgraph induced by the set of vertices labeled one or two has no isolated ...
Chakradhar Padamutham +1 more
openaire +2 more sources
Signed total double Roman k-domination in graphs
Discrete Mathematics, Algorithms and Applications, 2019A signed total double Roman [Formula: see text]-dominating function (STDRkDF) on an isolated-free graph [Formula: see text] is a function [Formula: see text] such that (i) every vertex [Formula: see text] with [Formula: see text] has at least two neighbors assigned 2 under [Formula: see text] or at least one neighbor [Formula: see text] with [Formula:
Shahbazi, L. +3 more
openaire +2 more sources
On computing total double Roman domination number of trees in linear time
2020Let $G=(V,E)$ be a graph. A doubleRoman dominating function (DRDF) on $G$ is a function$f:Vto{0,1,2,3}$ such that for every vertex $vin V$if $f(v)=0$, then either there is a vertex $u$ adjacent to $v$ with $f(u)=3$ orthere are vertices $x$ and $y$ adjacent to $v$ with $f(x)=f(y)=2$ and if $f(v)=1$, then there is a vertex $u$ adjacent to $v$ with$f(u ...
A. Poureidi
openaire +2 more sources