Results 201 to 210 of about 1,161 (229)

Climate-driven reduction in biomass production of the Eurasian steppe coincides with nomadic migration during the first millennium CE. [PDF]

Proc Natl Acad Sci U S A
Chen F, Zhao X, Yue W, Wang S, Zhang Y, Chen Y, Hu M, Esper J, Büntgen U, Ljungqvist FC, Hessl AE, Torbenson MCA, Yuan Y, Hadad MA, Roig FA, Cao H, Zhang H, Liang Y, Chen F.   +18 more
europepmc   +1 more source

Snapshots from a Fast‐Moving Train: Religious History 1960–2025

Journal of Religious History, EarlyView.
Alexandra Walsham
wiley   +1 more source

Farmed Escapees Threaten MHC Diversity in Wild Atlantic Salmon. [PDF]

Evol Appl
Lukacs M, Garseth ÅH, Karlsson S, Kausrud K, Benedicenti O, Sundaram AYM, Austbø L, Bøe CA, Lo H, Grimholt U.   +9 more
europepmc   +1 more source

Geodetic Roman Dominating Functions in a Graph

European Journal of Pure and Applied Mathematics, 2023
Let $G$ be a connected graph. A function $f: V(G)\rightarrow \{0,1,2\}$ is a \textit{geodetic Roman dominating function} (or GRDF) if every vertex $u$ for which $f(u)=0$ is adjacent to at least one vertex $v$ for which $f(v)=2$ and $V_1 \cup V_2$ is a geodetic set in $G$.
Sérgio Canoy, Rona Jane Gamayot Fortosa
exaly   +2 more sources

Convex Roman Dominating Function in Graphs

European Journal of Pure and Applied Mathematics, 2023
Let $G$ be a connected graph. A function $f:V(G)\rightarrow \{0,1,2\}$ is a \textit{convex Roman dominating function} (or CvRDF) if every vertex $u$ for which $f(u)=0$ is adjacent to at least one vertex $v$ for which $f(v)=2$ and $V_1 \cup V_2$ is convex.
Sérgio Canoy
exaly   +2 more sources

On Double Roman Dominating Functions in Graphs

European Journal of Pure and Applied Mathematics, 2023
Let G be a connected graph. A function f : V (G) → {0, 1, 2, 3} is a double Roman dominating function of G if for each v ∈ V (G) with f(v) = 0, v has two adjacent vertices u and w for which f(u) = f(w) = 2 or v has an adjacent vertex u for which f(u) = 3, and for each v ∈ V (G) with f(v) = 1, v is adjacent to a vertex u for which either f(u) = 2 or f(u)
Ferdinand Jamil
exaly   +2 more sources

Restrained Condition on Double Roman Dominating Functions

Applied Mathematics and Computation, 2023
We continue the study of restrained double Roman domination in graphs. For a graph $G=\big{(}V(G),E(G)\big{)}$, a double Roman dominating function $f$ is called a restrained double Roman dominating function (RDRD function) if the subgraph induced by $\{v\in V(G)\mid f(v)=0\}$ has no isolated vertices. The restrained double Roman domination number (RDRD
H Abdollahzadeh Ahangar, S M Sheikholeslami   +1 more
exaly   +5 more sources

Some of the next articles are maybe not open access.

Related searches:

Global Triple Roman Dominating Function

Discrete Applied Mathematics, 2022
A triple Roman dominating function (TRD-function) of a graph \(G\) is a function \(f: V(G) \rightarrow \{0, 1, 2, 3, 4\}\) such that if \(f(v) < 3\), then \(f(AN[v]) \ge |AN(v)| + 3\), where \(AN(v)\) is the set of neighbors of \(v\) assigned a non-zero value under \(f\).
Mustapha Chellali, H Abdollahzadeh Ahangar, S M Sheikholeslami   +2 more
exaly   +2 more sources

Algorithmic Results in Roman Dominating Functions on Graphs

SSRN Electronic Journal, 2022
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Abolfazl Poureidi, Jafar Fathali
openaire   +2 more sources