Results 131 to 140 of about 9,485,710 (280)
Minimum Rank, Zero Forcing Number and Network Propagation
A graph consists of vertices and edges. An edge connects a pair of vertices. The minimum rank of a graph G is the smallest rank that can be achieved by a symmetric matrix whose graph is G.
Chen, Moyang
core
Entropy‐Driven Design of Low‐Melting‐Point Alloys via Compositionally Complex Strategy
Conventional low‐melting‐point alloys (LMPAs) are limited by a narrow compositional space and inherent property trade‐offs. This review presents an entropy‐driven design strategy that overcomes these limitations, ushering in a new class of low‐melting‐point compositionally complex alloys (LMCCAs).
Yinghui Shang +6 more
wiley +1 more source
Stretching the Printability Metric in Direct‐Ink Writing with Highly Extensible Yield‐Stress Fluids
This study introduces “drawability” as a new metric for assessing printability in direct‐ink writing, focusing on gap‐spanning performance and speed robustness. By designing yield‐stress fluids with high extensibility, we demonstrate that extensional strain‐to‐break significantly enhances printability.
Chaimongkol Saengow +9 more
wiley +1 more source
Polarizable Vanadium Dipoles Promote Water Dissociation on Vanadium‐Based Metal Organic Framework
The polarization of unpaired V 3d electrons weakens the H─O bond to improve water dissociation by the dual Vδ+:O─H and Pλ−:H─O coupling hydrogen bonds formation and relaxation. P@V‐MOF electrocatalyst shows low overpotentials (94 mV in acid, 178 mV in neutral, and 77 mV in alkaline solutions) with excellent stability for effective overall water ...
Xinjuan Liu +13 more
wiley +1 more source
P4bm framework in NaNbO3‐Ba(Ti, Hf)O3 ferrodistortive relaxor entails short‐range and highly‐polar ferrodistortive orders. The abundant highly‐polar orders facilitate to increase entropy change, and robust octahedral oxygen tilt enables to impede thermal perturbations.
Feng Li +11 more
wiley +1 more source
Zero forcing in Benzenoid network
A set S of vertices in a graph G is called a dominating set of G if every vertex in V (G)\S is adjacent to some vertex in S. A set S is said to be a power dominating set of G if every vertex in the system is monitored by the set S following a set of ...
Anitha, J., Rajasingh, Indra
core +1 more source
Fully additive vertical organic electrochemical transistors (vOECTs) with channel‐length of 226 nm on a 50 µm compostable substrate achieve >106 current modulation and ∼36 mS transconductance. Ion‐selective integration enables 1.1 mA dec−1 sensitivity and 36 µm detection limit, highlighting a scalable platform for sustainable electronics and ...
Giulia Frusconi +3 more
wiley +1 more source
In situ Auger Electron Spectroscopy resolves oxidation states with high fidelity during the pulsed laser deposition of multivalent perovskite manganate and vanadate heterostructures. The chemical‐state signature is carried by the valence‐electron population of the transition‐metal cation, read out through the relative intensities of Auger fine ...
Harish Kumarasubramanian +1 more
wiley +1 more source
On a given graph G = (V, E) where each vertex can be colored blue or white, a zero forcing set on G describes a starting set of vertices to color blue, where every other vertex is colored white, such that by applying an iterative deterministic coloring ...
Lichtenberg, Noah Fan
core
On the Number of Zero Forcing Minimal Forts on Trees
We solve a conjecture by Becker et al. (arXiv:2404.05963) on the topic of zero forcing regarding the number of minimal forts of a tree. They conjectured and we prove $\mathcal{F}_{T_n} \le \binom{n}{2} \mathcal{F}_{P_n}$ where $\mathcal{F}_{T_n}$ is the maximum number of minimal forts on a tree on $n$ vertices and $\mathcal{F}_{P_n}$ is the number of ...
Dat, Nguyen Hoang +1 more
openaire +2 more sources

