24 citations · 31 across the 10 of their papers we have counts for
1 paper · 1 filter
Michael Ferrara, Zoltan Furedi, Sogol Jahanbekam +1
The distinguishing number of a graph G, denoted D(G), is the minimum number of colors needed to produce a coloring of the vertices of G so that every nontrivial isomorphism i…