Galois correspondence between permutation groups and cellular rings (association schemes)-Reference-Cited by-同舟云学术

Galois correspondence between permutation groups and cellular rings (association schemes)

Published:1990-12 Issue:4 Volume:6 Page:303-332
ISSN:0911-0119
Container-title:Graphs and Combinatorics
language:en
Short-container-title:Graphs and Combinatorics

Author:

Faradžev I. A.,Ivanov A. A.,Klin M. H.

Publisher

Springer Science and Business Media LLC

Subject

Discrete Mathematics and Combinatorics,Theoretical Computer Science

Link

http://link.springer.com/content/pdf/10.1007/BF01787700.pdf

Reference110 articles.

1. Adam, A.: Problem 2–10. J. Comb. Theory (A)2, 393 (1967)

2. Adam, A.: On some open problems of applied automation theory (suggested by the mathematical modelling of certain neuronal networks). Acta Cybern3, 187–214 (1977)

3. Adel'son-Velskii, G.M., Weisfeiler, B. Ju., Leman, A.A., Faradžev I.A.: Example of a graph without a transitive automorphism group. Sov. Math. Dokl.10, 440–441 (1969)

4. Aigner, M.: Combinatorial Theory. Springer, Berlin, Heidelberg, New York 1979

5. Algorithmic Investigations in Combinatorics. Nauka, Moscow 1978 (in Russian)

Cited by 26 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A non-Schurian coherent configuration on 14 points exists;Designs, Codes and Cryptography;2016-08-04

2. On the automorphism groups of strongly regular graphs II;Journal of Algebra;2015-01

3. Links between two semisymmetric graphs on 112 vertices via association schemes;Journal of Symbolic Computation;2012-10

4. A construction of the automorphism groups of indecomposable S-rings over $${Z_{2^n}}$$;Beiträge zur Algebra und Geometrie / Contributions to Algebra and Geometry;2011-03-30

5. Links between Latin squares, nets, graphs and groups: Work inspired by a paper of A. Barlotti and K. Strambach;Electronic Notes in Discrete Mathematics;2005-11