Results 101 to 110 of about 166,225,520 (254)
Computing Well-Balanced Spanning Trees of Unweighted Networks
AlgorithmsA spanning tree of a network or graph is a subgraph that connects all nodes with the minimum number or total weight of edges. Spanning trees are among the simplest yet most effective techniques for network simplification, sampling, and uncovering a ...
Lovro Šubelj
doaj +1 more source
Broadening Hard‐Magnet Discovery Beyond Symmetry Constraints via Unified Effective Anisotropy
Advanced Science, EarlyView.A unified effective‐anisotropy descriptor (Keff) extends hard‐magnet screening across all seven crystal systems, beyond the uniaxial restriction of conventional searches. Machine‐learning screening of 9320 known ferromagnets and diffusion‐model generation together yield 38 rare‐earth‐free or ‐lean candidates with DFT‐validated magnetic hardness (κ > 1),
Hojae Kim +5 more
wiley +1 more source
Counting Spanning Trees in Various Products of Two Complete Bipartite Graphs
MathematicsCalculating the number of spanning trees in a graph is a crucial problem in combinatorics and physics that has been thoroughly researched for many years by mathematicians and physicists.
Salama Nagy Daoud, Ahmad Asiri
doaj +1 more source
Advanced Science, EarlyView.This work provides a practical guide for neuroengineers to design advanced neural interfaces, embracing and tailoring the concept of functional disorder. By bridging 2D and 3D in vitro models, this work highlights how non‐periodic, spatially heterogeneous, multiscale nanotopography can enable more physiologically relevant platforms for studying neural ...
F. Maita +4 more
wiley +1 more source
Irving Fisher and Index Number Theory [PDF]
There are four main approaches to bilateral index number theory: the fixed basket, stochastic, test and economic approaches. The paper reviews the contributions of Irving Fisher to these approaches to index number theory which are still in use today. The
Diewert, Erwin
core
The number of spanning trees of a graph
, 2013 Let G be a simple connected graph of order n, m edges, maximum degree Delta(1) and minimum degree delta. Li et al. (Appl. Math. Lett. 23: 286-290, 2010) gave an upper bound on number of spanning trees of a graph in terms of n, m, Delta(1) and delta: t(
Das, Kinkar Chandra, Çevik, Ahmet Sinan
core +1 more source
Advanced Science, EarlyView.Interpretable machine learning reveals how composition and processing govern the formation and microstructural burden of Fe‐rich intermetallic compounds in recycled Al–Si–Fe–Mn alloys. By separating morphology selection from morphology‐conditioned burden partitioning, this framework shows that identical Fe contents can yield different intermetallic ...
Jaemin Wang +2 more
wiley +1 more source
Advanced Science, EarlyView.A physics‐informed property‐bridging framework links high‐throughput hardness screening to tensile performance in quenching and partitioning steels. By transferring metallurgically guided representations across properties, a single alloy composition is designed to achieve multiple strength grades through heat‐treatment tuning alone, offering a ...
Xiaolu Wei +7 more
wiley +1 more source
Counting the number of spanning trees in some special graphs
, 2002 The number of spanning trees in a (di-)graph (network) is an important, well-studied quantity. Most research about the number of spanning trees is devoted to determining exact formulae for the number of spanning trees in many kinds of special graphs.In ...
Zhang, Yuanping
core
Advanced Science, EarlyView.A machine learning‐assisted framework optimizes the KCl‐CaCl2‐LiCl ternary electrolyte. The optimized 13:35:52 mol% composition enables Ca‐based liquid metal batteries to operate stably at 480 °C, with >99.5% coulombic efficiency, ultralow self‐discharge, and excellent cycling stability, advancing low‐temperature large‐scale energy storage.
Xinglin Zhou +3 more
wiley +1 more source