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

  • 图X称为边正则图;若X的自同构群Aut(X)在X的边集上的作用是正则的.
目录 查词历史