Results 71 to 80 of about 954,754 (291)
Completely Independent Spanning Trees in k-Th Power of Graphs
Let T1, T2, . . . , Tk be spanning trees of a graph G. For any two vertices u, v of G, if the paths from u to v in these k trees are pairwise openly disjoint, then we say that T1, T2, . . . , Tk are completely independent. Araki showed that the square of
Hong Xia
doaj +1 more source
Reliable Route Selection for Wireless Sensor Networks with Connection Failure Uncertainties
For wireless sensor networks (WSN) with connection failure uncertainties, traditional minimum spanning trees are no longer a feasible option for selecting routes.
Jianhua Lyu +3 more
doaj +1 more source
Packing of rigid spanning subgraphs and spanning trees
We prove that every (6k + 2l, 2k)-connected simple graph contains k rigid and l connected edge-disjoint spanning subgraphs. This implies a theorem of Jackson and Jordán [4] and a theorem of Jordán [6] on packing of rigid spanning subgraphs. Both these results are generalizations of the classical result of Lovász and Yemini [9] saying that every 6 ...
Cheriyan, Joseph +2 more
openaire +6 more sources
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
Formulas for the Number of Spanning Trees in a Chain of Cycles
We give a formula for the number of spanning trees in a chain of cycles that have connected intersection of one edge but where the cycles have variable sizes. The formula uses basic properties of continued fractions.
Thomas Bier
doaj +1 more source
Melanin content directly controls fungal spore mechanical properties, with pigmented spores achieving rupture forces two orders of magnitude higher than hyaline spores. Environmental stress drives this quantity‐quality tradeoff; stressed species invest energy in melanin‐reinforced, mechanically superior thick‐walled, super‐hydrophobic spores, while ...
Atul Agrawal, Steven E. Naleway
wiley +1 more source
Spanning trees homeomorphic to a small tree
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Akira Saito, Kazuki Sano
openaire +1 more source
Architecture‐Driven Functional Coupling in Vertically Aligned Nanocomposites
Vertically aligned nanocomposites define a growth‐engineered architecture in which vertical interfaces, strain fields, defect pathways, and phase connectivity are created simultaneously. This review shows how these architectural features couple ferroic, optical, ionic, electrochemical, and device responses, establishing design rules and open challenges
Md Shatil Islam‐Shanto +4 more
wiley +1 more source
Computing Well-Balanced Spanning Trees of Unweighted Networks
A 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
Biodegradable 3D‐Printable and Coatable Antifouling Composites for Marine Applications
Marine biofouling damages submerged surfaces and raises greenhouse gas emissions. Biodegradable antifouling biocomposites were developed by hot‐mixing beeswax, Tween 80, and calcium stearate or stearic acid. Adjusting the component ratio enables processing via hot‐pressing, 3D‐printing, or dip‐coating.
Gabriele Corigliano +17 more
wiley +1 more source

