Assertion: connected finite graph | /r/HasProperty | symmetric
Facets:
value: equivalently
type: DEGREE
value: almost
type: DEGREE
Source sentences:
text: Mohar (1991) defines a connected locally finite graph to be "almost symmetric" if there exist a vertex v and a number D such that, for every other vertex w, there is an automorphism of the graph for which the image of v is within distance D of w; equivalently, a connected locally finite graph is almost symmetric if its automorphism group has finitely many orbits.