On Computing the Distinguishing Numbers of Planar Graphs and Beyond: a Counting Approach

V. Arvind, Christine T. Cheng, Nikhil R. Devanur

A vertex k-labeling of graph G is distinguishing if the only automorphism that preserves the labels of G is the identity map. The distinguishing number of G, D(G), is the smallest…