7 citations · 14 across the 15 of their papers we have counts for
1 paper · 2 filters
Wilfried Imrich, Rafał Kalinowski, Florian Lehner +2
A graph G is asymmetrizable if it has a set of vertices whose setwise stablizer only consists of the identity automorphism. The motion m of a graph is the minimum number of ver…