Weighted Tree

A tree to whose nodes and/or edges labels (usually number) are assigned.

The word "weight" also has a more specific meaning when applied to trees, namely the weight of a tree at a point u is the maximum number of edges in any branch at u (Harary 1994, p. 35), as illustrated above. A point having minimal weight for the tree is called a centroid point, and the tree centroid is the set of all centroid points.

See also

Centroid Point, Labeled Graph, Taylor's Condition, Tree, Tree Centroid, Weighted Graph

Explore with Wolfram|Alpha

References

Harary, F. Graph Theory. Reading, MA: Addison-Wesley, 1994.

Referenced on Wolfram|Alpha

Weighted Tree

Cite this as:

Weisstein, Eric W. "Weighted Tree." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/WeightedTree.html

Subject classifications