Results 41 to 50 of about 85,878 (263)
Restrained condition on double Roman dominating functions
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
Samadi, Babak +6 more
openaire +3 more sources
Advanced Experiment Design Strategies for Drug Development
Wang et al. analyze 592 drug development studies published between 2020 and 2024 that applied design of experiments methodologies. The review surveys both classical and emerging approaches—including Bayesian optimization and active learning—and identifies a critical gap between advanced experimental strategies and their practical adoption in ...
Fanjin Wang +3 more
wiley +1 more source
Delenda est haec Carthago: the Ostend company as a problem of European great power politics (1722-1727) [PDF]
The Ostend Company (1722-1731) is a symbol of present-day Belgium’s strangling by European Great Power politics in the Ancien Régime, and more specifically of the limitations imposed on the Southern Netherlands by the Dutch Republic in 1648.
Dhondt, Frederik
core +3 more sources
On the Independent Double Roman Domination in Graphs [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Doost Ali Mojdeh, Zhila Mansouri
openaire +2 more sources
On Double Roman Dominating Functions in Graphs
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)
Jerry Boy Cariaga, Ferdinand Jamil
openaire +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
Use of antiemetics in early pregnancy 2012–2022: A cross‐sectional study
Aim Nausea and vomiting in pregnancy impact quality of life, yet many pregnant women feel dismissed by healthcare professionals, despite the safety of first‐line antiemetic treatments for both mother and fetus. Therefore, this study aims to describe the prevalence of patient‐reported antiemetic use in early pregnancy in Copenhagen, Denmark, the changes
Katrine Bak Wraae +6 more
wiley +1 more source
Signed total double Roman dominating functions in graphs
A signed total double Roman dominating function (STDRDF) on an isolated-free graph [Formula: see text] is a function [Formula: see text] such that (i) every vertex v with [Formula: see text] has at least two neighbors assigned 2 under f or one neighbor w
L. Shahbazi +2 more
doaj +1 more source
Navigating the Double Edge of Product‐Service Systems: User Behavior, Adoption, and Rebound Effects
ABSTRACT Product‐service systems (PSS) have been considered a promising approach to operationalizing the circular economy. Although many studies have outlined the potential sustainability gains of PSS solutions, it is still unclear what factors drive PSS adoption and how behavioral changes result in rebound effects, undermining their potential ...
Marina Fernandes Aguiar +3 more
wiley +1 more source
Masculine crusaders, effeminate Greeks, and the female historian: relations of power in Sir Walter Scott's Count Robert of Paris [PDF]
Gender employed as a methodological lens in the analysis of historical fiction can help to reveal implicit or explicit evaluative statements. It is deployed here to examine hierarchies in the military, political and cultural context of the encounter ...
Kolovou, Ioulia
core

