Results 31 to 40 of about 405 (227)
On the Double Roman Domination in Generalized Petersen Graphs P(5k,k)
Mathematics, 2022 A double Roman dominating function on a graph G=(V,E) is a function f:V→{0,1,2,3} satisfying the condition that every vertex u for which f(u)=0 is adjacent to at least one vertex assigned 3 or at least two vertices assigned 2, and every vertex u with f(u)
Darja Rupnik Poklukar, Janez Žerovnik
doaj +1 more source
On the Independent Double Roman Domination in Graphs [PDF]
Bulletin of the Iranian Mathematical Society, 2019 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Doost Ali Mojdeh, Zhila Mansouri
openaire +2 more sources
The Restrained Double Roman Domination and Graph Operations
Applied Mathematics and Computation, 2023 Let $G=(V(G),E(G))$ be a simple graph. A restrained double Roman dominating function (RDRD-function) of $G$ is a function $f: V(G) \rightarrow \{0,1,2,3\}$ satisfying the following properties: if $f(v)=0$, then the vertex $v$ has at least two neighbours assigned 2 under $f$ or one neighbour $u$ with $f(u)=3$; and if $f(v)=1$, then the vertex $v$ must ...
Zhipeng Gao, Changqing Xi, Jun Yue
openaire +3 more sources
On the Outer Independent Double Roman Domination Number [PDF]
Bulletin of the Iranian Mathematical Society, 2021 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Doost Ali Mojdeh +3 more
openaire +1 more source
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
Babak Samadi +6 more
openaire +3 more sources
Protection of Lexicographic Product Graphs
Discussiones Mathematicae Graph Theory, 2022 In this paper, we study the weak Roman domination number and the secure domination number of lexicographic product graphs. In particular, we show that these two parameters coincide for almost all lexicographic product graphs. Furthermore, we obtain tight
Klein Douglas J. +1 more
doaj +1 more source
Advanced Materials, EarlyView.This work investigates the heterogeneous nucleation of CsPbBr3${\rm CsPbBr}_3$ nanocrystal superlattices along the faces of 2D PEA2PbBr4${\rm PEA}_2{\rm PbBr}_4$ layered perovskite microcrystals. Core–crown and core–shell heterostructure morphologies are obtained.
Umberto Filippi +6 more
wiley +1 more source
Advanced Science, EarlyView.Our findings establish SUMOylation as a key post‐translational control layer in auxin signaling. We show that SIZ1‐mediated SUMOylation of LBD29 promotes its association with ARF7, stabilizing a transcriptional hub that governs lateral root development.
Jiaxuan Sui +7 more
wiley +1 more source
Signed total double Roman dominating functions in graphs
AKCE International Journal of Graphs and CombinatoricsA 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
The Double Roman Domatic Number of a Digraph
Discussiones Mathematicae Graph Theory, 2020 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