### 3.7.241. Symmetric

Denotes the fact that a constraint is defined by a graph constraint for which the final graph is symmetric. A digraph is symmetric if and only if, if there is an arc from a vertex $u$ to a vertex $v$, there is also an arc from $v$ to $u$.