Results 91 to 100 of about 227,714 (275)
Packing of rigid spanning subgraphs and spanning trees
Journal of Combinatorial Theory, Series B, 2014 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 +4 more sources
Spanning trees without adjacent vertices of degree 2
, 2019 Albertson, Berman, Hutchinson, and Thomassen showed in 1990 that there exist highly connected graphs in which every spanning tree contains vertices of degree 2.
Lyngsie, Kasper Szabo, Merker, Martin
core +1 more source
Engineering a Spin‐Orbit Bandgap in Graphene‐Tellurium Heterostructures
Advanced Functional Materials, EarlyView.Tellurium intercalation in epitaxial graphene on Ir(111) enables the emergence of a spin–orbit‐induced bandgap with energy spin splitting. By combining STM, ARPES, spin‐resolved ARPES, and DFT, two structural phases are identified, both exhibiting tunable electronic doping.
Beatriz Muñiz Cano +14 more
wiley +1 more source
Polynomial Time Approximation Schemes for the Constrained Minimum Spanning Tree Problem
Journal of Applied Mathematics, 2012 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
Aksioma: Jurnal Program Studi Pendidikan Matematika, 2012 One of useful graph theory to solve the real problems is Minimum Spanning Tree (MST). MST is network optimization problems that can be applied in many fields such as transportations problems and communication network design (Gruber and Raidl, 2005).
Swaditya Rizki
doaj +1 more source
Leafy spanning trees in hypercubes
Applied Mathematics Letters, 2001 AbstractWe prove that the d-dimensional hypercube, Qd, with n = 2d vertices, contains a spanning tree with at least leaves. This improves upon the bound implied by a more general result on spanning trees in graphs with minimum degree δ, which gives (1 − O(log log n)/log2n)n as a lower bound on the maximum number of leaves in spanning trees of n-vertex
Duckworth, W +3 more
openaire +2 more sources
On the Crossing Spanning Tree Problem [PDF]
, 2004 Given an undirected n-node graph and a set c of m cuts, the minimum crossing spanning tree is a spanning tree which minimizes the maximum crossing of any cut in c where the crossing of a cut is the number of edges in the intersection of this cut and the tree.
BILO', VITTORIO +3 more
openaire +3 more sources
Advanced Functional Materials, EarlyView.This study demonstrates an alternative method of creating charge‐stable negatively charged nitrogen vacancy (NV−) centers close to the diamond surface without high‐temperature annealing. By illuminating nitrogen‐implanted regions with a continuous‐wave 405 nm laser, NV− centers are induced, exhibiting electron spin coherence properties suitable for ...
Jens Fuhrmann +4 more
wiley +1 more source
, 2012 In the classical (min-cost) Steiner tree problem, we are given an edge-weighted undirected graph and a set of terminal nodes. The goal is to compute a min-cost tree S which spans all terminals.
Grandoni, Fabrizio
core +1 more source
Conformally Perforated Shellular Metamaterials with Tunable Thermomechanical and Acoustic Properties
Advanced Functional Materials, EarlyView.This study introduces Conformally Perforated Shellular Metamaterials (CPSMs), which overcome TPMS design limitations by mapping 2D cellular layouts onto 3D surfaces. CPSMs exhibit enhanced elastic stiffness, thermal conductivity, and acoustic performance compared to intact P‐type shellulars, demonstrating their potential as multifunctional ...
Benyamin Shahryari +8 more
wiley +1 more source