Results 91 to 100 of about 309,634 (292)
High Entropy Wide‐Bandgap Borates with Broadband Luminescence and Large Nonlinear Optical properties
High‐entropy rare‐earth borates exhibit excellent nonlinear optical and broadband luminescence properties arising from multi‐component doping, chemical disorder, increased configurational entropy, and increased lattice and electronic anharmonicity. This formulation enabled us to obtain a large, environmentally stable single crystal with 3X higher laser‐
Saugata Sarker +14 more
wiley +1 more source
Efficient Maintenance of Minimum Spanning Trees in Dynamic Weighted Undirected Graphs
This paper presents an algorithm for effectively maintaining the minimum spanning tree in dynamic weighted undirected graphs. The algorithm efficiently updates the minimum spanning tree when the underlying graph structure changes.
Mao Luo +5 more
doaj +1 more source
Maksimum jumlah spanning - tree graph terhubung [PDF]
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
Negative association in uniform forests and connected graphs
We consider three probability measures on subsets of edges of a given finite graph $G$, namely those which govern, respectively, a uniform forest, a uniform spanning tree, and a uniform connected subgraph. A conjecture concerning the negative association
Grimmett, G. R., Winkler, S. N.
core +6 more sources
Conductive Bonding and System Architectures for High‐Performance Flexible Electronics
This review outlines bonding technologies and structural design strategies that support high‐performance flexible and stretchable electronics. Bonding approaches such as surface‐activated bonding and anisotropic conductive films, together with system‐level architectures including buffer layers and island‐bridge structures, possess distinct mechanical ...
Kazuma Nakajima, Kenjiro Fukuda
wiley +1 more source
In the complete graph on n vertices, when each edge has a weight which is an exponential random variable, Frieze proved that the minimum spanning tree has weight tending to zeta(3)=1/1^3+1/2^3+1/3^3+... as n goes to infinity.
Angel, Omer +2 more
core +1 more source
Nanothermometry in Living Cells: Physical Limits, Conceptual and Material Challenges
Heat and temperature are fundamental to life. When nanothermometers began probing regions as small as a living cell, they triggered controversial claims of large intracellular temperature gradients. We review physical constraints energy‐conservation, entropy production, thermodynamic fluctuations, and molecular dynamics.
Taras Plakhotnik
wiley +1 more source
Spanning Trees whose Stems have a Bounded Number of Branch Vertices
Let T be a tree, a vertex of degree one and a vertex of degree at least three is called a leaf and a branch vertex, respectively. The set of leaves of T is denoted by Leaf(T).
Yan Zheng
doaj +1 more source
ACC forms via aggregating prenucleation clusters that gatekeep its chemical composition. Ion identity steers the path: Ba and Sr substitute Ca in clusters, thereby inhibiting nucleation, with a dose‐dependent switch of Sr to induction. Mg partitions into Mg‐rich and Mg‐poor clusters; the latter form ACC, expelling Mg.
Qianyu Zhao +9 more
wiley +1 more source
An Edge-Swap Heuristic for Finding Dense Spanning Trees
Finding spanning trees under various restrictions has been an interesting question to researchers. A "dense" tree, from a graph theoretical point of view, has small total distances between vertices and large number of substructures.
Mustafa Ozen +3 more
doaj +1 more source

