By Debra Boutin

A subset U of vertices of a graph G is called a determining set if every automorphism of G is uniquely determined by its action on the vertices of U. A subset W is called a resolving set if every vertex in G is uniquely determined by its distances to... Show more

August 10, 2008

Loading full text...

Similar articles

Loading recommendations...

x1

Determining sets, resolving sets, and the exchange property

Click on play to start listening