Sciweavers

COMBINATORICS
2006
132views more  COMBINATORICS 2006»
14 years 16 days ago
On Computing the Distinguishing Numbers of Trees and Forests
Let G be a graph. A vertex labeling of G is distinguishing if the only label-preserving automorphism of G is the identity map. The distinguishing number of G, D(G), is the minimum...
Christine T. Cheng