On average edge length of minimum spanning trees

• Published in: Information processing letters Vol. 70; no. 5; pp. 241 - 243
• Main Authors: Nath, Suman Kumar, Chowdhury, Rezaul Alam, Kaykobad, M.
• Format: Journal Article
• Language: English
• 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

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...