Computing Isomorphisms of Association Schemes and its Application

摘要

Isomorphisms of association schemes are isomorphisms of edge-labeled regular graphs permitting to permute the labels. We give an algorithm computing isomorhisms of asso- ciation schemes using their algebraic property. We also study an application of computing isomorphisms of associated schemes to computing normalizers of permutation groups.