In graph theory, a distinguishing coloring or distinguishing... - dofaq.co
distinguishing coloring

In graph theory, a distinguishing coloring or distinguishing...

wikipedia - 19 Aug 2015
In graph theory, a distinguishing coloring or distinguishing labeling of a graph is an assignment of colors or labels to the vertices of the graph that destroys all of the nontrivial symmetries of the graph. The coloring does not need to be a proper coloring: adjacent vertices are allowed to be given the same color. For the colored graph, there should not exist any one-to-one mapping of the vertices to themselves that preserves both adjacency and coloring. The minimum number of colors in a dis

What's New