Recognizing Circulant Graphs of Prime Order in Polynomial Time
暂无分享,去创建一个
[1] Alexander A. Ivanov,et al. Investigations in Algebraic Theory of Combinatorial Objects , 1994 .
[2] Eiichi Bannai,et al. Subschemes of some association schemes , 1991 .
[3] M. Klin,et al. Cellular Rings and Groups of Automorphisms of Graphs , 1994 .
[4] E. Bannai,et al. Algebraic Combinatorics I: Association Schemes , 1984 .
[5] Noboru Ito. Hadamard Tournaments with Transitive Automorphism Groups , 1984, Eur. J. Comb..
[6] Ilia Ponomarenko,et al. On Primitive Cellular Algebras , 1997 .
[7] B. Weisfeiler. On construction and identification of graphs , 1976 .
[8] D. G. Higman. Coherent configurations , 1975 .
[9] Eiichi Bannai,et al. Character Tables of Fission Schemes and Fusion Schemes , 1993, Eur. J. Comb..
[10] Alexander A. Ivanov,et al. Galois correspondence between permutation groups and cellular rings (association schemes) , 1990, Graphs Comb..
[11] I. Ponomarenko. Polynomial time algorithms for recognizing and isomorphism testing of cyclic tournaments , 1992 .
[12] Luitpold Babel,et al. STABCOL: Graph Isomorphism Testing Based on the Weisfeiler-Leman Algorithm , 1997 .
[13] M. Klin,et al. The König problem, the isomorphism problem for cyclic graphs and the characterization of Schur rings , 1978 .