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 in a tree may be implemented in a future version of the Wolfram Language as SiblingVertex[g, v].