On highly closed cellular algebras and highly closed isomorphisms

Electronic Journal of Combinatorics

Volumn 6, Issue 1, 1999, Pages

  Evdokimov, Sergei ^a   Ponomarenko, Ilia ^b  

^a ST PETERSBURG INSTITUTE FOR INFORMATICS AND AUTOMATION   (Russian Federation)

^b STEKLOV MATHEMATICAL INSTITUTE   (Russian Federation)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0345748873     PISSN: 10778926     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (18)

1. C. Berge, Graphs and Hypergraphs, North-Holland Publ. Co., London, 1973.
2. E. Bannai, T. Ito, Algebraic Combinatorics I. Association schemes, Benjamin/Cummings, London, 1984.
3. J. Cai, M. Fürer, N. Immerman, Optimal lower bound on the number of variables for graph identification, Combinatorica 12 (1992), 389-410.
4. S. A. Evdokimov, M. Karpinski, I. N. Ponomarenko, On a New High Dimensional Weisfeiler-Lehman Algorithm, (accepted to J. of Algebraic Combinatorics).
5. S. A. Evdokimov, I. N. Ponomarenko, On primitive cellular algebras, to appear in Zapiski Nauchnykh Seminarov POMI, 256 (1999).
6. S. A. Evdokimov, I. N. Ponomarenko, Two Inequalities for the Parameters of a Cellular Algebra, Zapiski Nauchnykh Seminarov POMI, 240 (1997), 82-95.
7. I. A. Faradžev, M. H. Klin, M. E. Muzichuk, Cellular rings and groups of automorphisms of graphs, in: I. A. Faradžev et al. (eds): Investigations in algebraic theory of combinatorial objects, Kluwer Acad. Publ., Dordrecht, 1994, 1-152.
8. S. Friedland, Coherent algebras and the graph isomorphism problem, Discrete Appl. Math., 25 (1989), 73-98.
9. M. D. Hestens, D. G. Higman, Rank 3 groups and strongly regular graphs, SIAMAMS Proc., 4 (1971), 141-159.
10. D. G. Higman, Coherent algebras, Linear Algebra Appl., 93 (1987), 209-239.
11. G. Ivanyos, On the combinatorics of Evdokimov's deterministic factorization method, Preprint, 1997.
12. F. Lazebnik, V. A. Ustimenko, A. J. Woldar, A characterization of the components of the graphs D(k, q), Discrete Math., 157 (1996), 271-283.
13. J. D. H. Smith, Association schemes, superschemes, and the relation invariant under permutation groups, European J. Combin., 15 (1994), 285-291.
14. V. A. Ustimenko, Coordinates of Trees and their Quotients, in "Voronoj's Impact in Modern Science", Kiev, Institute of Mathematics, 2 (1998), 125-152.
15. M. Watkins, Connectivity of transitive graphs, J. Combin. Theory, 8 (1970), 23-29.
16. B. Ju. Weisfeiler, A. A. Lehman, Reduction of a graph to a canonical form and an algebra which appears in the process, NTI, Ser.2, (1968), 9, 12-16.
17. B. Ju. Weisfeiler (editor), On construction and identification of graphs, Springer Lecture Notes, 558, 1976.
18. H. Wielandt, Finite permutation groups, Academic press, New York - London, 1964.