海词手机词典
  • A labeling of a graph G is said to be r-distinguishing if no automorphism of G preserves all of the vertex labels.

    播放读音 播放读音