Assertion: graph's path | /r/CapableOf | meet at single central node
Facets:
value: with degree
type: OTHER
Source sentences:
text: To see this, observe that in a tree, the union of the three shortest paths between pairs of the three vertices a, b, and c is either itself a path, or a subtree formed by three paths meeting at a single central node with degree three.