Sets admitting connection by graphs of finite lengthстатья
Информация о цитировании статьи получена из
Web of Science,
Scopus
Статья опубликована в журнале из списка Web of Science и/или Scopus
Дата последнего поиска статьи во внешних источниках: 18 июля 2013 г.
Аннотация:The aim of the present article is to describe and investigate the
properties of the subsets of a metric space $\X$, that can be connected by
a graph of a finite length. We have obtained a criterium describing such
subsets, found several geometrical properties (in the case $\X=\R^n$), and
also discovered a way to calculate the length of minimal spanning tree for
$M\ss\X$ as an integral of a real function constructed by $M$.