Results 61 to 70 of about 152,920 (311)
Double Roman reinforcement number in graphs
AKCE International Journal of Graphs and Combinatorics, 2021 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
Discussiones Mathematicae Graph Theory, 2017 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
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
Emergent Spin‐Glass Behavior in an Iron(II)‐Based Metal–Organic Framework Glass
Advanced Functional Materials, EarlyView.A one‐pot, solvent‐free synthesis yields an Fe2+‐based metal‐organic framework (MOF) glass featuring a continuous random network structure. The material exhibits spin‐glass freezing at 14 K, driven by topological‐disorder and short‐range magnetic frustration, showcasing the potential of MOF glasses as a plattform for cooperative magnetic phenomena in ...
Chinmoy Das +8 more
wiley +1 more source
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
On the D-differential of a graph
AKCE International Journal of Graphs and Combinatorics, 2022 Let [Formula: see text] be a graph of order n(G). For a subset S of V(G), the boundary of S is defined as [Formula: see text] where N(S) is the open neighborhood of S.
Kijung Kim
doaj +1 more source
Advanced Healthcare Materials, EarlyView.Here, we present a novel 3D cell patterning and culture platform. The “Floor‐Ceiling‐Chip” (FC‐Chip) consists of two opposing track‐etched membranes, creating a pseudo‐3D microenvironment for the cells in between. By providing the membranes with micropatterned cell‐adhesive islands of varying geometries and sizes, the FC‐Chip enables control over cell ...
Urandelger Tuvshindorj +10 more
wiley +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
The politics of historical economics: Wilhelm Roscher on democracy, socialism and Caesarism [PDF]
, 2016 Wilhelm Friedrich Georg Roscher (1817-94) is generally remembered as a significant nineteenth-century German political economist and a contributor to the “German Historical School of Economics.” His work is usually placed in the context of a larger ...
McDaniel, Iain
core +1 more source
Quasi total double Roman domination in graphs
AKCE International Journal of Graphs and CombinatoricsA quasi total double Roman dominating function (QTDRD-function) on a graph [Formula: see text] is a function [Formula: see text] having the property that (i) if f(v) = 0, then vertex v must have at least two neighbors assigned 2 under f or one neighbor w
S. Kosari +4 more
doaj +1 more source