x_{1} (node in a tree graph) and x_{2} (node in the same tree graph) have an essentially-unique most recent (graph-nearest) common ancestor node A such that x_{3} [nonnegative integer; li] is d(A, x_{1)} and such that x_{4} [nonnegative integer; li] is d(A, x_{2)}, where d is the graph geodesic distance (defined to be infinite if nodes are not connected in the correct direction).

This word is much like "tseingu" except the focus is on the relationships between x_{1} and x_{2} each with their mutual most recent common ancestor; notice that this word is pretty natural, whereas "tseingu" is not (and is probably malgli except for the purpose of translations). For nodes x_{1} and x_{2} in a tree, (x_{3,x} is named by Curtis Franks to be the "ancestance between x_{1} and x_{2} (in that order)". In order to preserve meaning, mutual exchange of x_{1} and/with x_{2} must necessitate or be necessitated by mutual exchange of x_{3} and/with x_{4}.

- tseingu
- x
_{1}(node in a tree graph) and x_{2}(node in the same tree graph) have an essentially unique most recent (graph-nearest) common ancestor node A such that x_{3}[nonnegative integer; li] is the minimum element of the set consisting only of d(A, x_{1)}and of d(A, x_{2)}, and such that x_{4}[integer; li] is d(A, x_{1) - d(}A, x_{2)}, where d is the graph geodesic distance (defined to be infinite if nodes are not connected in the correct direction).