By Debra Boutin and others

A set *S* of vertices is a determining set for a graph *G* if every automorphism of *G* is uniquely determined by its action on *S*. The size of a smallest determining set for *G* is called its determining number, *Det(G)*. A graph *G* is said to be *d*-distinguishable if... Show more

March 8, 2021

Loading full text...

Similar articles

Loading recommendations...

x1

Determining Number and Cost of Generalized Mycielskian Graphs

Click on play to start listening