Results 81 to 90 of about 954,754 (291)
Spanning trees for many different numbers of leaves [PDF]
Let $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
Metal‐free carbon catalysts enable the sustainable synthesis of hydrogen peroxide via two‐electron oxygen reduction; however, active site complexity continues to hinder reliable interpretation. This review critiques correlation‐based approaches and highlights the importance of orthogonal experimental designs, standardized catalyst passports ...
Dayu Zhu +3 more
wiley +1 more source
Time-space trade-offs for computing Euclidean minimum spanning trees
$\newcommand{\EMST}{\mathrm{EMST}}\newcommand{\RNG}{\mathrm{RNG}}$We present time-space trade-offs for computing the Euclidean minimum spanning tree of a set $S$ of $n$ point-sites in the plane.
Bahareh Banyassady +2 more
doaj +1 more source
Spanning Trees in Dense Graphs [PDF]
In this paper we prove the following almost optimal theorem. For any δ > 0, there exist constants c and n0 such that, if n [ges ] n0, T is a tree of order n and maximum degree at most cn/log n, and G is a graph of order n and minimum degree at least (1/2 + δ)n, then T is a subgraph of G.
János Komlós +2 more
openaire +3 more sources
Organic Materials of Tomorrow: Horizons of Artificial Intelligence
This review examines machine learning techniques accelerating the discovery of organic semiconductors by linking molecular structure to properties. Key methods include graph neural networks, generative models, and active learning. Applications to organic photovoltaics demonstrate practical impact.
Harold Mena +3 more
wiley +1 more source
Measuring the Hall Effect in Hysteretic Materials
The authors highlight common pitfalls in measuring the Hall effect: in hysteretic magnets, improper data processing can create signals that look exotic but are not real. This Perspective explains the origin of these artifacts and presents practical measurement strategies that help researchers identify reliable Hall responses in complex magnetic ...
Jaime M. Moya +6 more
wiley +1 more source
On the SPANNING k-TREE problem
A \(k\)-tree \(T\) is defined recursively as being either a clique of size \(k\) or having a vertex \(x\) whose neighbourhood is a clique of size \(k\) and such that \(T-x\) is a \(k\)-tree. (Note that \(k\)-trees are not trees, if \(k>1\).) The following SPANNING \(k\)-TREE problem is known to be NP-complete: given a graph \(G\), does \(G\) possess a ...
Leizhen Cai, Frédéric Maffray
openaire +3 more sources
Breaking the Surface: Buoyant Metal–Polymer Open–Cell Hybrid Lattice Metamaterials
Open‐cell metal–polymer lattice metamaterials that defy sinking. (a) Injection process of the polyurethane (PU) foam into the titanium (Ti‐6Al‐4V) hollow‐strut lattice creating the open‐cell Ti‐6Al‐4V+PU hybrid lattice, (b) flotation test of a hybrid lattice specimen, and (c) a digital representation and experimental validation of a marine buoy ...
Jordan Noronha +7 more
wiley +1 more source
Almost disjoint spanning trees
International audienceIn this extended abstract, we only consider connected graphs. Let k ≥ 2 be an integer and T 1 ,. .. , T k be spanning trees in a graph G. A vertex is said to be an inner vertex in a tree T if it has degree at least 2 in T. We denote
Gastineau, Nicolas +2 more
core +3 more sources
The Maximum Distance Problem and Minimum Spanning Trees
Given a compact E⊂Rn and s>0, the maximum distance problem seeks a compact and connected subset of Rn of smallest one dimensional Hausdorff measure whose s-neighborhood covers E.
Enrique G. Alvarado +2 more
doaj

