1 paper · 1 filter
Ted Dobson, Ademir Hujdurović, Wilfried Imrich +1
A set of vertices of a graph is distinguishing if the only automorphism that preserves it is the identity. The minimal size of such sets, if they exist, is the distinguishing cost.…