Minimal spanning trees on infinite sets

From MaRDI portal
Publication:1708282

DOI10.1007/S10958-017-3380-XzbMATH Open1383.05053arXiv1403.3831OpenAlexW2964314383MaRDI QIDQ1708282FDOQ1708282


Authors: A. A. Tuzhilin, A. O. Ivanov Edit this on Wikidata


Publication date: 5 April 2018

Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

Abstract: Minimal spanning trees on infinite vertex sets are investigated. A criterion for minimality of a spanning tree having a finite length is obtained, which generalizes the corresponding classical result for finite sets. It is given an analytic description of the set of all infinite metric spaces which a minimal spanning tree exists for. A sufficient condition for a minimal spanning tree existence is obtained in terms of distances achievability between partitions elements of the metric space under consideration. Besides, a concept of locally minimal spanning tree is introduced, several properties of such trees are described, and relations of those trees with (globally) minimal spanning trees are investigated.


Full work available at URL: https://arxiv.org/abs/1403.3831




Recommendations




Cites Work


Cited In (7)





This page was built for publication: Minimal spanning trees on infinite sets

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