Results 71 to 80 of about 227,714 (275)
The Emerging 4D Printing of Shape‐Memory Thermomorphs for Self‐Adaptative Biomedical Implants
Advanced Functional Materials, EarlyView.4D printing enables the creation of smart implants that adapt to changing conditions in the human body over time. At the core of this technology are shape‐memory thermomorphs (SMTMs). This review offers an in‐depth analysis of 4D printing with SMTMs, emphasizing the latest advancements in smart materials, stimuli, programming principles, and their ...
Aixiang Ding, Fang Tang, Eben Alsberg
wiley +1 more source
The Problem of Predecessors on Spanning Trees
Acta Polytechnica, 2011 We consider the equiprobable distribution of spanning trees on the square lattice. All bonds of each tree can be oriented uniquely with respect to an arbitrary chosen site called the root. The problem of predecessors is to find the probability that a path along the oriented bonds passes sequentially fixed sites i and j.
V. B. Priezzhev, V.S. Poghosyan
openaire +5 more sources
Maksimum jumlah spanning - tree graph terhubung [PDF]
, 1996 Spanning-tree merupakan bagian dari graph yang merupakan suatu tree. Dan dari setiap graph dapat dibentuk paling sedikit satu spanning-tree. Suatu graph G = ( V,E ) yang sederhana dapat ditentukan jumlah spanning-treenya den an inetode penukaran ...
Yuliati , Siti
core
On the Properties of Gromov Matrices and their Applications in Network Inference
, 2019 The spanning tree heuristic is a commonly adopted procedure in network inference and estimation. It allows one to generalize an inference method developed for trees, which is usually based on a statistically rigorous approach, to a heuristic procedure ...
Ji, Feng, Tang, Wenchang, Tay, Wee Peng
core +1 more source
Advanced Functional Materials, EarlyView.The negative differential resistance is exploited, using a La0.67Sr0.33MnO3 thin film network to demonstrate various neuronal functionalities of the human brain, such as leaky‐integrate‐fire and oscillatory patterns. Transmission electron microscope studies show local modification in oxygen octahedra in the network leads to co‐existing phases ...
Azminul Jaman +6 more
wiley +1 more source
Spanning trees with many leaves: new extremal results and an improved FPT algorithm [PDF]
, 2006 We present two lower bounds for the maximum number of leaves in a spanning tree of a graph. For connected graphs without triangles, with minimum degree at least three, we show that a spanning tree with at least (n+4)/3 leaves exists, where n is the ...
Bonsma, P.S.
core +2 more sources
Advanced Functional Materials, EarlyView.This work investigates modifying interfacial contacts in realizing giant‐performance semiconductor nanomembrane optoelectronics. Strategies, including surface reaction and buffer layer work‐function modulation, are explored to boost the Schottky barrier. An emerging material of YbOx is utilized for near‐ideal Ohmic contact.
Yibo Zhang +5 more
wiley +1 more source
Spanning trees for many different numbers of leaves [PDF]
Discrete Mathematics & Theoretical Computer ScienceLet $G$ be a connected graph and $L(G)$ the set of all integers $k$ such that $G$ contains a spanning tree with exactly $k$ leaves. We show that for a connected graph $G$, the set $L(G)$ is contiguous.
Kenta Noguchi, Carol T. Zamfirescu
doaj +1 more source
Mathematical and Computer Modelling, 1991 It is shown that the number of labeled spanning trees of a connected graph is equal to the determinant of the intersection matrix for an integral basis of its cycles. The one-skeletons of a convex polyhedron and its dual have the same number of spanning trees. An integral cycle basis is constructed for graphs possessing rotational symmetry.
openaire +2 more sources