On the number of leaves of a euclidean minimal spanning tree

DOI10.2307/3214207zbMATH Open0639.60014OpenAlexW2121599632MaRDI QIDQ3780174FDOQ3780174

Authors: J. Michael Steele, Larry Shepp, William F. Eddy 

Publication date: 1987

Published in: Journal of Applied Probability (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/04c343d99693171cc07c5514d2a54eefb0f1e3d1

Recommendations

• Minimal spanning trees with a constraint on the number of leaves
• Lower bounds on the number of leaves in spanning trees
• Bounds of the number of leaves of spanning trees
• On finding spanning trees with few leaves
• Spanning trees with minimum number of leaves in the square graph of a tree
• On the number of minimal dominating sets including the set of leaves in trees
• Spanning trees with a bounded number of leaves
• On minimum leaf spanning trees and a criticality notion
• Bounds of the number of leaves of spanning trees in graphs without triangles
• On the area requirements of Euclidean minimum spanning trees

zbMATH Keywords

Efron-Stein inequalityself-similar processesvertex degreessubadditive Euclidean functionalsEuclidean minimal spanning tree

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Inequalities; stochastic orderings (60E15) Strong limit theorems (60F15) Combinatorial probability (60C05)

Cited In (19)

• Designing electricity distribution networks: the impact of demand coincidence
• An average case analysis of the minimum spanning tree heuristic for the power assignment problem
• Intrinsic dimension identification via graph-theoretic methods
• A fractal dimension for measures via persistent homology
• Title not available (Why is that?)
• On the multivariate runs test
• Degree Frequencies in the Minimal Spanning Tree and Dimension Identification
• Weak laws of large numbers in geometric probability
• The central limit theorem for Euclidean minimal spanning trees. I
• Asymptotics for Euclidean minimal spanning trees on random points
• Multidimensional medians arising from geodesics on graphs
• Tail bound for the minimal spanning tree of a complete graph.
• On properties of geometric random problems in the plane
• Intrinsic dimension estimation: relevant techniques and a benchmark framework
• The random minimal spanning tree in high dimensions
• Euclidean semi-matchings of random samples
• Algorithms for Euclidean degree bounded spanning tree problems
• On minimum leaf spanning trees and a criticality notion
• A bound on the number of leaves in a spanning tree of a connected graph of minimum degree 6

This page was built for publication: On the number of leaves of a euclidean minimal spanning tree

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3780174)