By Debra Boutin and Sally Cockburn

A graph *G* is said to be *d*-distinguishable if there is a labeling of the vertices with *d* labels so that only the trivial automorphism preserves the labels. The smallest such *d* is the distinguishing number, Dist(*G*). A subset of vertices *S* is a determining set for *G* if every... Show more

January 19, 2020

Loading full text...

Similar articles

Loading recommendations...

x1

Bounds on the Distinguishing Number of Orthogonality Graphs

Click on play to start listening