图的边可区别数是破坏图对称性的最小可区别的边标号数（颜色数）。

The edge distinguishing number of a graph G is the minimum number of the distinguishing labelings (colors) of the edges in G for which destroys the symmetries of G.

youdao

图的边可区别数是破坏图对称性的最小可区别的边标号数（颜色数）。

The edge distinguishing number of a graph G is the minimum number of the distinguishing labelings (colors) of the edges in G for which destroys the symmetries of G.

youdao