Assertion: graph's vertex | /r/HasProperty | listed in order
Facets:
value: v 1
type: OTHER
value: v 2
type: OTHER
Source sentences:
text: A path graph or linear graph of order n ≥ 2 is a graph in which the vertices can be listed in an order v 1 , v 2 , …, v n such that the edges are the {v i
text: In the mathematical field of graph theory, a path graph or linear graph is a graph whose vertices can be listed in the order v 1 , v 2 , …, v n such that the edges are {v i , v i+1 } where i = 1, 2, …, n − 1.
text: A cycle graph or circular graph of order n ≥ 3 is a graph in which the vertices can be listed in an order v 1 , v 2 , …, v n such that the edges are the {v i , v i+1 } where i = 1, 2, …, n − 1, plus the edge {v n , v 1 }.