Results 51 to 60 of about 838 (256)
Angewandte Chemie, EarlyView.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
Total roman domination in digraphs
, 2021 Let D be a nite and simple digraph with vertex set V (D). A Roman dominating function (RDF) on a digraph D is a function f : V (D) → {0; 1; 2} satisfying the condition that every vertex v with f(v) = 0 has an in-neighbor u with f(u) = 2. The weight of an
Zhuang, Wei, Hu, Kangxiu, Hao, Guoliang
core
Total Roman domination edge-critical graphs [PDF]
Involve, a Journal of Mathematics, 2019 A total Roman dominating function on a graph $G$ is a function $% f:V(G)\rightarrow \{0,1,2\}$ such that every vertex $v$ with $f(v)=0$ is adjacent to some vertex $u$ with $f(u)=2$, and the subgraph of $G$ induced by the set of all vertices $w$ such that $f(w)>0$ has no isolated vertices. The weight of $f$ is $Σ_{v\in V(G)}f(v)$.
Lampman, Chloe +2 more
openaire +4 more sources
Diversity, 2023 Halmyris (Murighiol, Tulcea County, Romania) is one of the most important Roman settlements located in the inferior sector of the Danube Delta, in the easternmost part of Scythia province during the Late Antiquity.
Margareta Simina Stanc +4 more
doaj +1 more source
Signed double Roman domination on cubic graphs [PDF]
, 2023 The signed double Roman domination problem is a combinatorial optimization problem on a graph asking to assign a label from $\{\pm{}1,2,3\}$ to each vertex feasibly, such that the total sum of assigned labels is minimized.
Iurlano, Enrico +3 more
core +2 more sources
Total Roman 2-Reinforcement of Graphs
Journal of Mathematics, 2021 A total Roman 2-dominating function (TR2DF) on a graph Γ=V,E is a function l:V⟶0,1,2, satisfying the conditions that (i) for every vertex y∈V with ly=0, either y is adjacent to a vertex labeled 2 under l, or y is adjacent to at least two vertices labeled
M. Kheibari +3 more
doaj +1 more source
Total Roman domination in graphs
Applicable Analysis and Discrete Mathematics, 2016 A Roman dominating function on a graph G is a function f:V(G) → {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. The weight of a Roman dominating function f is the sum, ΣuV(G) f(u), of the weights of the vertices.
Hossein Ahangar Abdollahzadeh +3 more
openaire +2 more sources
CoRR, 2022 In this paper we deal with the signed Roman domination and signed total Roman domination problems. For each problem we propose two integer linear programming (ILP) formulations, the constraint programming (CP) formulation and variable neighborhood search (VNS) method.
Vladimir Filipovic +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
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