Results 131 to 140 of about 9,977,087 (284)
Zero forcing in iterated line digraphs
Zero forcing is a propagation process on a graph, or digraph, defined in linear algebra to provide a bound for the minimum rank problem. Independently, zero forcing was introduced in physics, computer science and network science, areas where line ...
Thomas Kalinowski (21272096) +2 more
core
A hybrid additive manufacturing platform integrates direct droplet writing of metallic composite with VAT photopolymerization to fabricate architected soft magnetic composites. This approach enables microscale patterning of high‐viscosity materials for programmable actuators, adaptive fluidic devices, and switchable adhesives, offering tunable ...
Yeowon Yoon +4 more
wiley +1 more source
Understanding the preindustrial (PI) to present‐day (PD) change in cloud droplet number concentration (ΔNd) is important to constrain the anthropogenic influence on clouds and aid future model projections.
Hunter Y. Brown +6 more
doaj +1 more source
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
An integrated pulmonary mRNA delivery platform combining novel biodegradable syringic acid‐derived ionizable lipids, design‐of‐experiments formulation optimization, and vibrating‐mesh nebulizer engineering enabled stable aerosolization and efficient lung delivery.
Neha Kaushal +21 more
wiley +1 more source
Controllability and heterogeneity of river networks using spectral graph theory approach
River networks are important landscape features that have been extensively studied over many years. While seminal works have focused on characterizing the topological properties of river networks, the quantification of their spectral properties has ...
Shiblu Sarker +4 more
doaj +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
Keratin recovered from animal‐hair textile waste is fractionated and blended with cellulose to produce continuously spun hybrid fibers. Selecting the high‐molecular‐weight keratin fraction enables 30 wt.% keratin incorporation while maintaining high strength in dry and wet states.
Mian Zhai +6 more
wiley +1 more source
0047 | Zero Forcing Number in Neutrosophic Graphs
New setting is introduced to study zero forcing number and zero forcing neutrosophic-number. Leaf-like is a key term to have these notions. Let NTG : (V,E,σ,μ) be a neutrosophic graph. Then zero forcing number Z(NTG) for a neutrosophic graph NTG : (V,E,σ,μ) is minimum cardinality of a set S of black vertices (whereas vertices in V (G) \ S are colored ...
openaire +1 more source
This work presents a closed‐loop optimization workflow integrating CatBot, an automated synthesis and testing system, to discover NiMo hydrogen‐evolution catalysts. CatBot synthesised and evaluated 228 unique samples, identifying the best performing catalysts for transfer to nickel‐foam electrodes. The best candidate is highly active, reaching 1 Acm−2${
Paolo Vincenzo Freiesleben de Blasio +7 more
wiley +1 more source

