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).

While technically not good, this definition also employs the convention that x_{3} is positive (countable) infinity if A does not exist, meaning that x_{1} and x_{2} belong to mutually disjoint trees (or if at least one of them is undefined); in this case, x_{4} is not well-defined (see: "zi'au"). This word can be used to specify the concept of "nth cousin m-times removed"-ness; x_{1} and x_{2} would be the cousins, x_{3-1 }= n, and x_{4} is closely related to m but is signed. If one views the tree graphs to which x_{1} and x_{2} belong with the viewing perspective such that siblings and spouses are mutually separated horizontally and such that ancestors are separated from their descendants vertically (with ancestors in the positive direction relative to their descendants), then x_{3} is the unsigned horizontal distance between x_{1} and x_{2}. Additionally, x_{4} is, approximately, the signed generational offset/difference between subjects x_{1} and x_{2}; it is their signed 'vertical' difference under the aforementioned viewing perspective and sign convention. The relationship need not actually be cousinhood
(as perceived by English); direct ancestor-descendant pairs, (aunt/uncle)-(niece/nephew) pairs, and in fact any pair of family members with a well-specified most recent common ancestor (that is known) have this relationship to one another. This word can be used for specifying the number of "great"'s in the title of a relationship between x_{1} and x_{2} (with some calculational forethought). The tree diagram can be more generic than a family tree though; thus cousinhood is just a way to put it into context/application and is not really essential to the meaning except through analogy. Notice the ordering of all terms; if the graph is directed, the arguments of the distance matters. The graph should probably be a tree locally if it is to be a well-defined relationship. x_{3} is unchanged but x_{4} is negated (multiplied by -1) by/under exchange of x_{1} and x_{2}. The ordered pair (x_{3, x} is named "consanguistance between x_{1} and x_{2} (in that order)" by Curtis Franks. For a normal family tree and fixed x_{1} therein, consanguistance produces countably many equivalence classes of nodes. It does not recognize the difference between half or full relatives, marriages/parentings are either unsupported (when x_{3 > 0}) or are reduced to be equivalent (when x_{3 }= 0 and x_{4 \neq 0}), and gender/sex are ignored/reduced to equivalence. The set of nodes x_{2} with x_{3 }= 0 is called x_{1}'s (the subject's) genealogical line (id est: if x_{3 }= 0, then x_{1} re'au'e ja se dzena x_{2} according to the edge relation on the graph or x_{1 }= x_{2}); the set of nodes with x_{3 > 0} are sibling/branch/side lines, which could be labelled and ordered, but doing so would be somewhat difficult with this word. This word focuses on the relationship between x_{1} and x_{2}, not the relationship between each of them and A; for that, see ".anseingu". The underlying tree graph is, modulo an equivalence relation involving tseingu, a 'quipyew' tree graph (see "grafnkipliiu"). This concept is fairly unnatural and convoluted, so it is probably malgli except for the purpose of translations; in a natural, culturally-neutral Lojbanic context, ".anseingu" is preferred.

- ginlazdze
- x
_{1}is a genetic-familial/'blood' ancestor of x_{2}by bond/tie/relation/of degree x_{3}. - ginlazyseldze
- x
_{1}is a genetic-familial/'blood' descendant of x_{2}by bond/tie/relation/of degree x_{3}. - zi'au
- nonexistent/undefining it; the selbri is not applicable when the other terbri are filled in the manner in which they are in this utterance/bridi.
- anseingu
- 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). - grafnseljimcnkipliiu
- x
_{1}is a 'quipyew' tree graph with special node x_{2}, on nodes x_{3}(set of points; includes x_{2}), with edges x_{4}(set of ordered pairs of nodes), and with other properties x_{5}.