x_{1} and x_{2} are path-linked by directed binary predicate x_{3} (ka) via intermediate steps x_{4} (ordered list; ce'o) in graph x_{5}, such that (in the graph x_{5}) both (A) no other node exists to which x_{2} is connected in/by the same way/direction/relation and (B) no other node exists to which x_{1} is connected in/by the opposite/(anti)symmetric/reversed way/direction/relation.

Equivalent to "x_{1 \, x} fo x_{4 \, x} .utkaro fi x_{3} gi'e se .utkaro fi x_{3^-1}", where x_{3^-1} is binary relation/predicate x_{3} with the order of its two arguments exchanged (basically: "se"-converted). Multiple paths may connect x_{1} and x_{2}. There may be peripheral branches extending from x_{2} which are acyclic (or cyclic) such that they contain a node which has a directed distance from x_{2} which exceeds that of any path from x_{1} to x_{2}; it is just the case that for any path connecting x_{1} and x_{2} in either direction, x_{1} and x_{2} are root/leaf nodes thereof.