Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 1 of 1 for “"Distances between leaves"”.

  1. Labeled Trees and Spanning Trees: Computational Discrete Mathematics and Applications

    … integer edge weights such that the weighted distances between pairs of vertices are exactly from 1 to n choose 2. Only five Leech trees are known and some non-existence results have been presented through the years. Variations of Leech trees such as the minimal distinct distance trees and …

    gsu Repository record for Labeled Trees and Spanning Trees: Computational Discrete Mathematics and Applications (opens in a new tab)