By Debra Boutin and others

A graph *G* is *d*-distinguishable if there is a coloring of the vertices with *d* colors so that only the trivial automorphism preserves the color classes. The smallest such *d* is the distinguishing number, *\operatorname{Dist}(G)*. The Mycielskian *\mu(G)* of a graph *G* is constructed by adding a shadow vertex *u_i*... Show more

January 28, 2021

Loading full text...

Similar articles

Loading recommendations...

x1

Distinguishing Generalized Mycielskian Graphs

Click on play to start listening