Results 51 to 60 of about 129,130 (275)

Roman domination number of Generalized Petersen Graphs P(n,2) [PDF]

open access: yes, 2011
A $Roman\ domination\ function$ on a graph $G=(V, E)$ is a function $f:V(G)\rightarrow\{0,1,2\}$ satisfying the condition that every vertex $u$ with $f(u)=0$ is adjacent to at least one vertex $v$ with $f(v)=2$.
Ji, Chunnian   +3 more
core  

Structural Modulation of Charge Transfer in Donor–Acceptor Systems: Effects of Donor Type and Connectivity

open access: yesAdvanced Optical Materials, EarlyView.
A coherent phthalimide acceptor platform with planar (Cz—carbazole) and spiro‐type (SAF—spiroacridine fluorene) donors enables systematic tuning of donor geometry and coupling, driving the evolution of excited‐state topology from classical CT‐TADF and fluorescence/RTP to CT‐driven and LE‐assisted TADF with OLED efficiencies ≈ 36%.
Christopher Anton Wallerius   +8 more
wiley   +1 more source

Weak Signed Roman Domination in Digraphs

open access: yesTamkang Journal of Mathematics, 2021
Let $D$ be a finite and simple digraph with vertex set $V(D)$. A weak signed Roman dominating function (WSRDF) on a digraph $D$ is a function $f:V(D)\rightarrow\{-1,1,2\}$ satisfying the condition that $\sum_{x\in N^-[v]}f(x)\ge 1$ for each $v\in V(D)$, where $N^-[v]$ consists of $v$ and allvertices of $D$ from which arcs go into $v$.
openaire   +8 more sources

Some Properties of Double Roman Domination [PDF]

open access: yesDiscrete Dynamics in Nature and Society, 2020
A double Roman dominating function on a graph G is a function f:VG⟶0,1,2,3 satisfying the conditions that every vertex u for which fu=0 is adjacent to at least one vertex v for which fv=3 or two vertices v1 and v2 for which fv1=fv2=2 and every vertex u for which fu=1 is adjacent to at least one vertex v for which fv≥2.
Hong Yang, Xiaoqing Zhou
openaire   +3 more sources

Advanced Experiment Design Strategies for Drug Development

open access: yesAdvanced Intelligent Discovery, EarlyView.
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

Hydration Behavior of Tricalcium Silicate in Seawater Relevant Salt Systems: A Hybrid Study with the Aid of Machine Learning

open access: yesAdvanced Intelligent Discovery, EarlyView.
The hydration behavior of C3S in seawater‐relevant solutions is studied based on experiments, boundary nucleation and growth (BNG) modeling, and machine learning. The main ions included in seawater modify hydration mechanisms, with MgCl2 showing the strongest acceleration effect at the same concentration.
Yanjie Sun   +6 more
wiley   +1 more source

Varieties of Roman domination IV

open access: yesAKCE International Journal of Graphs and Combinatorics
Roman domination was introduced in 2004 by Cockayne, Dreyer, Hedetniemi, and Hedetniemi. If [Formula: see text] is the vertex set of a graph G, then a function [Formula: see text] is a Roman dominating function if every vertex [Formula: see text] for ...
M. Chellali   +3 more
doaj   +1 more source

Hop total Roman domination in graphs

open access: yesAKCE International Journal of Graphs and Combinatorics, 2023
In this article, we initiate a study of hop total Roman domination defined as follows: a hop total Roman dominating function (HTRDF) on a graph [Formula: see text] is a function [Formula: see text] such that for every vertex u with f(u) = 0 there exists ...
H. Abdollahzadeh Ahangar   +3 more
doaj   +1 more source

Iovem Imperium, or Sacred Aspects of Roman “Globalization” [PDF]

open access: yes, 2014
The article deals with the question of the “globalization” project of the Roman civilization. Author asserts that the Romans had a specific “globalization” project.
Halapsis, Alex V.
core  

On trees with equal Roman domination and outer-independent Roman domination numbers

open access: yesCommunications in Combinatorics and Optimization, 2019
Summary: A Roman dominating function (RDF) on a graph \(G\) is a function \(f : V (G) \to \{0, 1, 2\}\) satisfying the condition that every vertex \(u\) for which \(f(u) = 0\) is adjacent to at least one vertex \(v\) for which \(f(v) = 2\). A Roman dominating function \(f\) is called an outer-independent Roman dominating function (OIRDF) on \(G\) if ...
Sheikholeslami, Seyed Mahmoud   +1 more
openaire   +2 more sources

Home - About - Disclaimer - Privacy