On average edge length of minimum spanning trees

This paper presents a theorem that asserts that average edge length of the minimum spanning tree of a complete graph on n+1 vertices is less than or equal to the average edge length of all the n+1 minimum spanning trees of the induced graph on n vertices. The result is also in compliance with result...

Full description

Saved in:
Bibliographic Details
Published inInformation processing letters Vol. 70; no. 5; pp. 241 - 243
Main Authors Nath, Suman Kumar, Chowdhury, Rezaul Alam, Kaykobad, M.
Format Journal Article
LanguageEnglish
Published Amsterdam Elsevier B.V 21.06.1999
Elsevier Science
Elsevier Sequoia S.A
Subjects
Applied sciences
Average edge length
Complete graph
Computer science; control theory; systems
Exact sciences and technology
Graphs
Information processing
Information retrieval. Graph
Minimum spanning tree
Studies
Theoretical computing
Complete graph
Average edge length
Minimum spanning tree
Edge(graph)
Graph theory
Tree(graph)
Spanning tree
Online AccessGet full text

Cover

More Information
Summary:This paper presents a theorem that asserts that average edge length of the minimum spanning tree of a complete graph on n+1 vertices is less than or equal to the average edge length of all the n+1 minimum spanning trees of the induced graph on n vertices. The result is also in compliance with results given by Frieze and Steele.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
content type line 14
ISSN:0020-0190
1872-6119
DOI:10.1016/S0020-0190(99)00068-X