Sciweavers

CORR
2007
Springer
130views Education» more  CORR 2007»
14 years 13 days ago
On Computing the Distinguishing Numbers of Planar Graphs and Beyond: a Counting Approach
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...
Vikraman Arvind, Christine T. Cheng, Nikhil R. Dev...