海词手机词典
  • A graph is said to be an edge-regular graph, if its full automorphism group Aut(X) acts regularly on its edge-set.

    播放读音 播放读音