Results 31 to 40 of about 990 (254)

On The Roman Domination Stable Graphs

open access: yesDiscussiones 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

Total Roman Domination Number of Rooted Product Graphs

open access: yesMathematics, 2020
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

Macromolecular Condensates as Tunable Scaffolds for Bio‐Inspired Silica Hybrids

open access: yesAngewandte Chemie, EarlyView.
Dense bio‐inspired silica formation is achieved by coupling polyamine liquid–liquid phase separation with pH‐dependent silica polymerization. Silicification within polyamine condensates, enables precise control over particle size, density, and morphology.
Protap Biswas   +6 more
wiley   +2 more sources

Emergent Spin‐Glass Behavior in an Iron(II)‐Based Metal–Organic Framework Glass

open access: yesAdvanced 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

Modular Assembly of Dynamic Polymer Networks From Heteroaffinity Cross‐Links to Multivalent Proteins

open access: yesAngewandte Chemie, EarlyView.
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

On the D-differential of a graph

open access: yesAKCE 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

Scalable Thermal Engineering via Femtosecond Laser‐Direct‐Written Phononic Nanostructures

open access: yesAdvanced Functional Materials, EarlyView.
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

Quasi total double Roman domination in graphs

open access: yesAKCE International Journal of Graphs and Combinatorics
A 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

Mapping Nanoscale Buckling in Atomically Thin Cr2Ge2Te6

open access: yesAdvanced Functional Materials, EarlyView.
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

Graphs with Large Hop Roman Domination Number [PDF]

open access: yesComputer Science Journal of Moldova, 2019
A subset $S$ of vertices of a graph $G$ is a hop dominating set if every vertex outside $S$ is at distance two from a vertex of $S$. A Roman dominating function on a graph $G=(V,E)$ is a function $f: V(G) \longrightarrow \{0, 1, 2\}$ satisfying the ...
E. Shabani, N. Jafari Rad, A. Poureidi
doaj  

Home - About - Disclaimer - Privacy