Results 81 to 90 of about 80,587 (266)
The Budgeted Labeled Minimum Spanning Tree Problem
In order to reduce complexity when designing multi-media communication networks, researchers often consider spanning tree problems defined on edge-labeled graphs.
Raffaele Cerulli +3 more
doaj +1 more source
2D α‐Co(OH)2 interleaved with Mo species displays an appealing dual functionality for the production and use of green hydrogen.Mo incorporation greatly benefits the electrochemical behaviour in Oxygen Evolution Reaction for H2 production, while the magnetocaloric response at liquid H2 temperature paves the way for alternative cryogenic refrigerants ...
Daniel Muñoz‐Gil +14 more
wiley +1 more source
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
Spin‐Split Edge States in Metal‐Supported Graphene Nanoislands Obtained by CVD
Combining STM measurements and ab‐initio calculations, we show that zig‐zag edges in graphene nanoislands grown on Ni(111) by CVD retrieve their spin‐polarized edge states after intercalation of a few monolayers of Au. ABSTRACT Spin‐split states localized on zigzag edges have been predicted for different free‐standing graphene nanostructures.
Michele Gastaldo +6 more
wiley +1 more source
Using a Significant Spanning Tree to Draw a Directed Graph
A directed graph can model any ordered relationship between objects. However, visualizing such graphs can be a challenging task. If the graph is undirected, a popular strategy is to choose a significant spanning tree, nominate a vertex as the root, for ...
Martin Harrigan, Patrick Healy
doaj +1 more source
Spanning trees with small diameters
A spanning tree with small diameter of a graph has many applications. In this paper we first make the following conjecture and show that the condition is best possible if it is true. If a connected graph satisfies , then has a spanning tree with diameter
Mikio Kano, Hajime Matsumura
doaj +1 more source
Asymptotic Enumeration of Spanning Trees [PDF]
We give new formulas for the asymptotics of the number of spanning trees of a large graph. A special case answers a question of McKay [Europ. J. Combin. 4 149–160] for regular graphs. The general answer involves a quantity for infinite graphs that we call ‘tree entropy’, which we show is a logarithm of a normalized determinant of the graph Laplacian ...
openaire +3 more sources
Atomistic Mechanisms Triggered by Joule Heating Effects in Metallic Cu‐Bi Nanowires for Spintronics
Bi doped metallic Cu nanowires are promising for spintronics thanks to the stabilization of a giant spin Hall effect. However, heat resulting from current injection forces Bi to leave solution, forcing segregation into monoatomic decorations which evolve into coherent crystalline aggregates.
Alejandra Guedeja‐Marrón +6 more
wiley +1 more source
Molecular doping of conjugated polymers is fundamentally constrained by thermodynamic phase behavior. This Perspective reframes doping efficiency and stability in terms of miscibility limits, binodals, and solvus boundaries, highlighting the role of effective interaction parameters and charge transfer.
Somayeh Kashani +10 more
wiley +1 more source
Polynomial Time Approximation Schemes for the Constrained Minimum Spanning Tree Problem
Let G=(V,E) be an undirected graph with a weight function and a cost function on edges. The constrained minimum spanning tree problem is to find a minimum cost spanning tree T in G such that the total weight in T is at most a given bound B. In this paper,
Yen Hung Chen
doaj +1 more source

