TOPICS
Search

Sibling


Two nodes connected to the same node which are same distance from the root vertex in a rooted tree are called siblings.

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


See also

Child, Root Vertex, Rooted Tree, Tree

Explore with Wolfram|Alpha

Cite this as:

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

Subject classifications