Results 71 to 80 of about 166,225,520 (254)
Completely Independent Spanning Trees in (Partial) k-Trees
Discussiones Mathematicae Graph Theory, 2015 Two spanning trees T1 and T2 of a graph G are completely independent if, for any two vertices u and v, the paths from u to v in T1 and T2 are internally disjoint.
Matsushita Masayoshi +2 more
doaj +1 more source
Advanced Materials, EarlyView.Water harvesting, radiative cooling, and interfacial solar evaporation are fundamentally governed by coupled heat, mass, and light transport processes. These processes are mediated by pore architecture, including pore size, connectivity, and hierarchical organization.
Dejan J. Trajkovski +5 more
wiley +1 more source
Fiber‐Format Flexible Linear Electrostatic Motors
Advanced Materials, EarlyView.A flexible coaxial fibre‐format electrostatic motor enables backdrivable and reversible linear actuation with high force density and functionality under bending, offering a scalable actuation platform for soft and wearable robotics. ABSTRACT Linear motion is fundamental to robotics, yet existing solutions are either rigid electromagnetic motors or ...
Sylvain Schaller, Herbert Shea
wiley +1 more source
On the number of spanning trees in random regular graphs [PDF]
, 2014 Let d >= 3 be a fixed integer. We give an asympotic formula for the expected number of spanning trees in a uniformly random d-regular graph with n vertices.
Catherine Greenhill +6 more
core +1 more source
Forest decompositions of graphs with cyclomatic number 3
International Journal of Mathematics and Mathematical Sciences, 1983 The simple tree polynomials of the basic graphs with cyclomatic number 3 are derived. From these results, explicit formulae for the number of decompositions of the graphs into forests with specified cardinalities are extracted.
E. J. Farrell
doaj +1 more source
Dental Microwear Texture Analysis on Radular Teeth
Advanced Materials Interfaces, EarlyView.3D microwear textures reveal how gastropod radular teeth respond to controlled abrasive contact. Distinct surface signatures distinguish regular abrasion from fracture‐dominated material removal, showing how mineralized coatings, fibrous cores, and substrate properties jointly shape wear and failure in a biological scraping interface.
Wencke Krings +2 more
wiley +1 more source
The number of spanning trees in odd valent circulant graphs [PDF]
, 2004 In this paper, we consider the number of spanning trees in circulant graphs. For any class of odd valent circulant graphs C2n(a1,a2,…,ak−1,n), where a1,a2,…,ak−1 are fixed jumps and n varies, some formulas, asymptotic behaviors and linear recurrence ...
Chen, Xiebin, Lin, Qiuying, Zhang, Fuji
core +1 more source
Open Mathematics, 2016 As a generalization of the Sierpiński-like graphs, the subdivided-line graph Г(G) of a simple connected graph G is defined to be the line graph of the barycentric subdivision of G.
Shang Yilun
doaj +1 more source
Smart Electrospun Nanofibers for Controlled Oil‐Water Separation
Advanced Materials Interfaces, EarlyView.Stimuli‐responsive electrospun nanofibers are reviewed as advanced platforms for controlled oil/water separation. The effects of surface wettability, porous structure, and external stimuli, including pH, temperature, gas, and light, on separation performance are discussed.
Aynaz Sedaghatnia +6 more
wiley +1 more source
Collision‐Resilient Winged Drones Enabled by Tensegrity Structures
Advanced Robotics Research, EarlyView.Based on structures of birds such as the woodpeck, this article presents the collision‐resilient aerial robot, SWIFT. SWIFT leverages tensegrity structures in the fuselage and wings which allow it to undergo large deformations in a crash, without sustaining damage. Experiments show that SWIFT can reduce impact forces by 70% over conventional structures.
Omar Aloui +5 more
wiley +1 more source