Results 51 to 60 of about 86,658 (242)
The Signed Total Mixed Roman Domination Numbers of Graphs
Abstract The problem of signed domination of graphs is a typical optimization problem. It requires that each vertex and edge be assigned a feasible label so that the sum of assigned labels is minimized. First, we propose the concept of a signed total mixed Roman domination number and introduce the related research progress.
Xia Hong, Li Zhang, Xiaobing Guo
openaire +1 more source
Scalable Thermal Engineering via Femtosecond Laser‐Direct‐Written Phononic Nanostructures
This study demonstrates that femtosecond laser‐induced periodic surface structures (fs‐LIPSS) can function as phononic metasurfaces, reducing thermal conductivity below the plain thin‐film limit. Phonon Monte Carlo analysis reveals that the periodic structures restrict phonon mean free paths.
Hiroki Hamma +4 more
wiley +1 more source
Modular Assembly of Dynamic Polymer Networks From Heteroaffinity Cross‐Links to Multivalent Proteins
This study develops a method to modularly assemble oligomeric binding proteins, like streptavidin, using heterobifunctional cross‐linkers that have both a strong‐ and a weak‐affinity binding moiety. These dynamic cross‐linkers enable the assembly of polymer networks with unique meta‐stable nonequilibrium topologies, and that exhibit chemically tunable ...
Tianyue Dai +6 more
wiley +2 more sources
The Signed Total Roman k-Domatic Number Of A Graph
Let k ≥ 1 be an integer. A signed total Roman k-dominating function on a graph G is a function f : V (G) → {−1, 1, 2} such that Ʃu2N(v) f(u) ≥ k for every v ∈ V (G), where N(v) is the neighborhood of v, and every vertex u ∈ V (G) for which f(u) = −1 is ...
Volkmann Lutz
doaj +1 more source
Signed total Roman $k$-domination in directed graphs
Let $D$ be a finite and simple digraph with vertex set $V(D)$. A signed total Roman $k$-dominating function (STR$k$DF) on $D$ is a function $f:V(D)\rightarrow\{-1, 1, 2\}$ satisfying the conditions that (i) $\sum_{x\in N^{-}(v)}f(x)\ge k ...
N. Dehgard, L. Volkmann
doaj +1 more source
The Number of Minimum Roman and Minimum Total Dominating Sets for Some Chessboard Graphs
In this paper, both the roman domination number and the number of minimum roman dominating sets are found for any rectangular rook’s graph. In a similar fashion, the roman domination number and the number of minimum roman dominating sets are found on the square bishop’s graph for odd board sizes.
openaire +2 more sources
Mill and Pettit on Freedom, Domination, and Freedom-as-Domination [PDF]
Pettit endorses a ‘republican’ conception of social freedom of the person as consisting of a state of non-domination, and takes this to refute Mill’s ‘liberal’ claim that non-domineering but coercive interference can compromise social freedom of choice ...
Beaumont, Tim
core +2 more sources
Mapping Nanoscale Buckling in Atomically Thin Cr2Ge2Te6
Atomic‐resolution STEM is used to resolve nanoscale buckling in monolayer Cr2Ge2Te₆. A noise‐robust image analysis reconstructs three‐dimensional lattice distortions from single plan‐view images, revealing pronounced defect‐driven nm‐scale out‐of‐plane buckling.
Amy Carl +20 more
wiley +1 more source
Nonnegative signed total Roman domination in graphs
Let $G$ be a finite and simple graph with vertex set $V(G)$. A nonnegative signed total Roman dominating function (NNSTRDF) on a graph $G$ is a function $f:V(G)\rightarrow\{-1, 1, 2\}$ satisfying the conditions that (i) $\sum_{x\in N(v)}f(x)\ge 0$ for
Nasrin Dehgardi, Lutz Volkmann
doaj +1 more source
Glass, historically valued for its purity and durability, has long inspired artists and societies. This article introduces the concept of “Archeo‐Inspiration”, drawing on cultural and historical contexts of glass to guide future material innovations.
Eva von Contzen +3 more
wiley +1 more source

