图的边可区别数是破坏图对称性的最小可区别的边标号数(颜色数)。
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.
And in order to label the various orbitals, as he called them, m he introduced two more quantum numbers, l and m.
为了给他所说的不同的轨道,标号,他又另外引进了两个量子数,l和。
应用推荐