Results 21 to 30 of about 4,433,930 (229)
An Algorithm to Construct Completely Independent Spanning Trees in Line Graphs
AbstractIn the past few years, much importance and attention have been attached to completely independent spanning trees (CISTs). Many results, such as edge-disjoint Hamilton cycles, traceability, number of spanning trees, structural properties, topological indices, etc., have been obtained on line graphs, and researchers have applied the line graphs ...
Yifeng Wang +4 more
openaire +1 more source
The Number of Spanning Trees in Generalized Complete Multipartite Graphs of Fan-Type [PDF]
Approaching topics such as connected simple graph, k-partite graph, complete graph, tree, Smarandache (E1,E2)-number of ...
Junliang Cai +3 more
core +1 more source
Estimating the weight of metric minimum spanning trees in sublinear time [PDF]
In this paper we present a sublinear-time $(1+\varepsilon)$-approximation randomized algorithm to estimate the weight of the minimum spanning tree of an $n$-point metric space. The running time of the algorithm is $\widetilde{\mathcal{O}}(n/\varepsilon^{\
Christian Sohler +3 more
core +1 more source
Completely Independent Spanning Trees in Some Regular Graphs
Let $k\ge 2$ be an integer and $T_1,\ldots, T_k$ be spanning trees of a graph $G$. If for any pair of vertices $(u,v)$ of $V(G)$, the paths from $u$ to $v$ in each $T_i$, $1\le i\le k$, do not contain common edges and common vertices, except the vertices
Gastineau, Nicolas +2 more
core +3 more sources
On Completely Edge-Independent Spanning Trees in Locally Twisted Cubes
A network can contain numerous spanning trees. If two spanning trees T i , T j do not share any common edges,
Xiaorui Li +4 more
openaire +3 more sources
Building machine‐readable vocabularies for materials science is slow, expert‐driven work. This study benchmarks 13 large language models on two of its first steps: finding candidate terms in engineering articles and deciding where they belong in a class hierarchy.
Thomas Bjarsch +3 more
wiley +1 more source
Shellac, a centuries‐old natural resin, is reimagined as a green material for flexible electronics. When combined with silver nanowires, shellac films deliver transparency, conductivity, and stability against humidity. These results position shellac as a sustainable alternative to synthetic polymers for transparent conductors in next‐generation ...
Rahaf Nafez Hussein +4 more
wiley +1 more source
Coordinated Architectural and Chemical Reinforcement in the Crushing Mandible of a Soldier Termite
The crushing mandible of a soldier termite withstands substantial biting loads despite lacking mineral. Its cuticle is partitioned: convex teeth pair hardness and zinc enrichment with aligned chitin fibers for contact durability, while stiffer concave regions between teeth carry bending loads.
Andrew Tran Nguyen +16 more
wiley +1 more source
On the probabilistic min spanning tree Problem [PDF]
International audienceWe study a probabilistic optimization model for min spanning tree, where any vertex v i of the input-graph G(V, E) has some presence probability p i in the final instance G′ ⊂ G that will effectively be optimized.
Paschos, V.T. +10 more
core +1 more source
HfxZr1−xO2${\rm Hf}_x{\rm Zr}_{1-x}{\rm O}_2$ offers CMOS‐compatible nanoscale ferroelectricity yet suffers from a high Ec${\rm E}_c$ demanding large operating voltages. A unified phase‐field framework spanning AFE/FE/DE phases shows how FE grains soften neighboring AFE grains over λ$\lambda$ ≈$\approx$ 22–37 nm.
P. Pankaj +4 more
wiley +1 more source

