Results 61 to 70 of about 80,587 (266)
Spanning Trees at the Connectivity Threshold
We present an explicit connected spanning structure that appears in a random graph just above the connectivity threshold with high probability.
Yahav Alon +2 more
openaire +3 more sources
Elastic Properties and Thermal Expansion Behavior of a Polycrystalline VMnFeCoNi High‐Entropy Alloy
The high‐entropy alloy (HEA) V20Mn20Fe20Co20Ni20 (composition in at.%) can be made single‐phase face‐centered cubic (FCC) when annealed above 1338 K followed by water quenching. In this state, the alloy exhibits the greatest strength‐ductility combination of any quinary single‐phase FCC HEA.
Guillaume Laplanche +3 more
wiley +1 more source
On the extreme complexity of certain nearly regular graphs
The complexity of a graph is the number of its labeled spanning trees. It is demonstrated that the seven known triangle-free strongly regular graphs are graphs of maximal complexity among all graphs of the same order and degree; their complements are ...
Gregory P Constantine, Gregory C Magda
doaj +1 more source
Controlling the Field Assisted Sintering Technology (FAST) parameters, dwell temperature and cooling rate, significantly influences the microstructural evolution in titanium aluminide GE4822. Significant γ‐lamellar colonies develop only upon cooling through the α‐transus.
Jack Krohn, James Pepper, Martin Jackson
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
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
The number of spanning trees of cyclic snakes
A cyclic snake is a connected graph formed by connecting, by means of vertex amalgamation, a certain number of copies of the cycle Cn, in such a way that the i-th copy of Cn is connected with the (i+1)-th copy, resulting in a graph with maximum degree 4.
Christian Barrientos
doaj +1 more source
This paper investigates the consensus of second-order multi-agent systems under switched topologies. Previous studies indicate that a consensus cannot be reached if the topology is fixed and has no spanning tree, but it is possible to reach a consensus ...
Dianhao Zheng +4 more
doaj +1 more source
Magnesium‐Based Transient Bioelectronics, Bio‐Optics and Bio‐Scaffolds
This paper reviews the state of the art and recent advances in magnesium‐based thin‐film, foils, and scaffolds for applications in transient bio‐optics, bioelectronics and tissue engineering. The design principles, fabrication methods, material properties, and integration strategies are discussed in detail.
Massimo Mariello, Yves Leterrier
wiley +1 more source
The author deals with infinite graphs. R. Halin defined an end \(E\) of an infinite graph \(G\) as a set of 1-way infinite paths in \(G\) such that vertices \(P\) and \(Q\) are in \(E\) iff for any subset \(R\) of the vertice set there is a finite path in \(G-R\) joining \(P\) and \(Q\). The author proves that if \(T\) is a locally finite spanning tree
openaire +2 more sources

