Assertion: graph's symmetry | /r/CapableOf | take any vertex
Facets:
value: to any other vertex
type: TRANSITIVE-OBJECT
Source sentences:
text: In particular, there exist symmetries taking any vertex to any other vertex, and any edge to any other edge, so the n-cycle is a symmetric graph.