Results 41 to 50 of about 302 (207)
Weak signed Roman domination in graphs [PDF]
A weak signed Roman dominating function (WSRDF) of a graph $G$ with vertex set $V(G)$ is defined as a function $f:V(G)\rightarrow\{-1,1,2\}$ having the property that $\sum_{x\in N[v]}f(x)\ge 1$ for each $v\in V(G)$, where $N[v]$ is the closed ...
Lutz Volkmann
doaj +1 more source
The 2-domination and Roman domination numbers of grid graphs
We investigate the 2-domination number for grid graphs, that is the size of a smallest set $D$ of vertices of the grid such that each vertex of the grid belongs to $D$ or has at least two neighbours in $D$. We give a closed formula giving the 2-domination number of any $n \!\times\! m$ grid, hereby confirming the results found by Lu and Xu, and Shaheen
Rao, Michaël, Talon, Alexandre
openaire +5 more sources
A Borane Sandwich Analogue of Ferrocene
The first ferrocene analogue with two boron‐based ligands is identified through a global exploration of the FeB10H20 potential energy surface. The η5,η5‐Fe(B5H10)2 complex emerges as the global minimum, showing that metal coordination inverts borane stability and enables aromatic boron rings inaccessible in isolation.
Viviana Roman‐Ventura +8 more
wiley +2 more sources
Roman game domination subdivision number of a graph [PDF]
A {em Roman dominating function} on a graph $G = (V ,E)$ is a function $f : Vlongrightarrow {0, 1, 2}$ satisfying the condition that every vertex $v$ for which $f (v) = 0$ is adjacent to at least one vertex $u$ for which $f (u) = 2$. The {em weight} of a
Jafar Amjadi +3 more
doaj
Homochiral Cu(I) cyanide complexes based on 2,2’‐bis(diphenylphosphino)‐1,1’‐binaphthyl (BINAP) form melt‐quenched and desolvation‐derived metal–organic glasses that exhibit circularly polarized thermally activated delayed fluorescence (TADF) at room temperature, enabling processable chiroptical materials.
Zeyu Fan +5 more
wiley +2 more sources
Double Roman reinforcement number in graphs
For a graph a double Roman dominating function is a function having the property that if f(v) = 0, then vertex v must have at least two neighbors assigned 2 under f or one neighbor w with f(w) = 3, and if f(v) = 1, then vertex v must have at least one ...
J. Amjadi, H. Sadeghi
doaj +1 more source
On The Roman Domination Stable Graphs
A Roman dominating function (or just RDF) on a graph G = (V,E) is a function f : V → {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.
Hajian Majid, Rad Nader Jafari
doaj +1 more source
Total double Roman domination in graphs [PDF]
Let $G$ be a simple graph with vertex set $V$. A double Roman dominating function (DRDF) on $G$ is a function $f:V\rightarrow\{0,1,2,3\}$ satisfying that if $f(v)=0$, then the vertex $v$ must be adjacent to at least two vertices assigned $2$ or one ...
Guoliang Hao +2 more
doaj +1 more source
Total Roman Domination Number of Rooted Product Graphs
Let G be a graph with no isolated vertex and f:V(G)→{0,1,2} a function. If f satisfies that every vertex in the set {v∈V(G):f(v)=0} is adjacent to at least one vertex in the set {v∈V(G):f(v)=2}, and if the subgraph induced by the set {v∈V(G):f(v)≥1} has ...
Abel Cabrera Martínez +3 more
doaj +1 more source
Layered Nanoporous Platforms for SERS Sensing
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

