Results 121 to 130 of about 227,714 (275)
Scalable Lithium Niobate Nanoimprinting for Nonlinear Metalenses
A broadband polycrystalline lithium niobate platform is developed for highly versatile and scalable fabrication of nonlinear metasurfaces. This work demonstrates simultaneous second harmonic generation and wavefront‐shaping via a metalens on this platform.
Ülle‐Linda Talts+3 more
wiley +1 more source
Spanning trees and domination in hypercubes
Let $L(G)$ denote the maximum number of leaves in any spanning tree of a connected graph $G$. We show the (known) result that for the $n$-cube $Q_n$, $L(Q_n) \sim 2^n = |V(Q_n)|$ as $n\rightarrow \infty$. Examining this more carefully, consider the minimum size of a connected dominating set of vertices $ _c(Q_n)$, which is $2^n-L(Q_n)$ for $n\ge2$. We
openaire +3 more sources
We consider the number of spanning trees in circulant graphs of $\beta n$ vertices with generators depending linearly on $n$. The matrix tree theorem gives a closed formula of $\beta n$ factors, while we derive a formula of $\beta-1$ factors.
Louis, Justine
core +1 more source
Topology in Biological Piezoelectric Materials
This review summarizes the topological structures in biological piezoelectric materials, covering morphology evolution, spatial arrangement, and biomimetic strategies. These topologies modulate structure‐property relationships across multiple scales, enabling performance enhancement and multifunctional integration.
Chen Chen+7 more
wiley +1 more source
This study presents a polyanhydride‐based delivery platform for single‐injection, self‐boosting vaccines. The system enables programmable, pulsatile release of diphtheria toxoid with high antigen recovery and is guided by machine learning for tunability. In vivo results show immune responses comparable to multi‐dose regimens, highlighting its potential
Linzixuan Zhang+17 more
wiley +1 more source
A note on the number of spanning trees of a graph [PDF]
Iva Rohlíčková
openalex +1 more source
A Vertex Oriented Approach to Minimum Cost Spanning Tree Problems [PDF]
In this paper we consider spanning tree problems, where n players want to be connected to a source as cheap as possible. We introduce and analyze (n!) vertex oriented construct and charge procedures for such spanning tree situations leading in n steps to
Ciftci, B.B., Tijs, S.H.
core +1 more source
The generalized minimum spanning tree polytope and related polytopes [PDF]
The Generalized Minimum Spanning Tree problem denoted by GMST is a variant of the classical Minimum Spanning Tree problem in which nodes are partitioned into clusters and the problem calls for a minimum cost tree spanning at least one node from each ...
Pop, P.C.
core +1 more source
Spin Engineering of Dual‐Atom Site Catalysts for Efficient Electrochemical Energy Conversion
This review highlights recent progress in spin engineering of dual‐atom site catalysts (DASCs), emphasizing how spin‐related properties enhance electrocatalytic activity, selectivity, and stability. It summarizes cutting‐edge developments in dual‐atom catalysis, discusses the underlying spin‐catalysis mechanisms and structure–performance relationships,
Dongping Xue+5 more
wiley +1 more source
Computing minimum spanning trees efficiently [PDF]
A. Kershenbaum, R. Van Slyke
openalex +1 more source