Assertion: tree's vertex | /r/HasProperty | connected by edge
Facets:
value: for 1
type: TEMPORAL
Source sentences:
text: A path graph (or linear graph ) consists of n vertices arranged in a line, so that vertices i and i +1 are connected by an edge for i =1,...
text: (or ) consists of vertices arranged in a line, so that vertices and +1 are connected by an edge for =1,..., −1.