Results 51 to 60 of about 129,618 (274)
Some Progress on the Double Roman Domination in Graphs
Discussiones Mathematicae Graph Theory, 2019 For a graph G = (V,E), a double Roman dominating function (or just DRDF) is a function f : V → {0, 1, 2, 3} having the property that if f(v) = 0 for a vertex v, then v has at least two neighbors assigned 2 under f or one neighbor assigned 3 under f, and ...
Rad Nader Jafari, Rahbani Hadi
doaj +1 more source
Roman domination number of Generalized Petersen Graphs P(n,2) [PDF]
, 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
On the total Roman domination in trees
Discussiones Mathematicae Graph Theory, 2019 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Amjadi Jafar +2 more
openaire +2 more sources
Layered Nanoporous Platforms for SERS Sensing
Advanced Materials Interfaces, EarlyView.Here, we present a detailed investigation of the SERS performance of layered nanoporous metals. The controlled deposition of well‐defined, stacked porous layers enabled a systematic analysis of the effects of multimetallic systems in SERS experiments. Numerical models are also used to support the experimental findings.
Yanqiu Zou +18 more
wiley +1 more source
On the Roman Bondage Number of Graphs on surfaces [PDF]
, 2014 A Roman dominating function on a graph $G$ is a labeling $f : V(G) \rightarrow \{0, 1, 2\}$ such that every vertex with label $0$ has a neighbor with label $2$. The Roman domination number, $\gamma_R(G)$, of $G$ is the minimum of $\Sigma_{v\in V (G)} f(v)
Samodivkin, Vladimir
core
On the weak Roman domination number of lexicographic product graphs
, 2018 A vertex $v$ of a graph $G=(V,E)$ is said to be undefended with respect to a function $f: V \longrightarrow \{0,1,2\}$ if $f(v)=0$ and $f(u)=0$ for every vertex $u$ adjacent to $v$.
Pérez-Rosés, Hebert +2 more
core +1 more source
Roman Domination in Weighted Graphs
MathematicsA Roman dominating function for a (non-weighted) graph G=(V,E) is a function f:V→{0,1,2} such that every vertex u∈V with f(u)=0 has at least one neighbor v∈V such that f(v)=2. The minimum weight ∑v∈Vf(v) of a Roman dominating function f on G is called the Roman domination number of G and is denoted by γR(G).
Martín Cera +2 more
openaire +3 more sources
Advanced Optical Materials, EarlyView.Four donor–acceptor boron difluoride complexes based on triphenylamine donor and a naphthyridine acceptor units were synthesized, studied, and applied as OLED emitters. They exhibit pronounced intramolecular charge transfer character, balanced charge transport properties, and tunable emission. Near‐unity PLQYs are achieved for selected compounds, while
Omar Lahna +8 more
wiley +1 more source
Advanced Electronic Materials, EarlyView.In dynamic driving scenarios, the proposed approach ensures only temporally aligned sensor inputs to make driving decisions, preventing false activations. By enabling selective hardware‐level learning, it achieves fast, reliable responses under noisy conditions.
Kapil Bhardwaj +4 more
wiley +1 more source
Hop total Roman domination in graphs
AKCE 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