TOPICS
Search

Vertex Height


The vertex height of a vertex v in a rooted tree is the number of edges on the longest downward path between v and a tree leaf.

The height of the root vertex of a rooted tree is known as the tree height.

A function to return the height of a vertex v in a tree g may be implemented in a future version of the Wolfram Language as TreeHeight[g, v].


See also

Root Vertex, Rooted Tree, Tree, Tree Height

Explore with Wolfram|Alpha

Cite this as:

Weisstein, Eric W. "Vertex Height." From MathWorld--A Wolfram Web Resource. https://mathworld.wolfram.com/VertexHeight.html

Subject classifications