Assertion: symmetric graph | /r/HasProperty | t-transitive
Facets:
value: for some t
type: OTHER
Source sentences:
text: Since 1-arcs are simply edges, every symmetric graph of degree 3 or more must be t-transitive for some t, and the value of t can be used to further classify symmetric graphs.