Abstract
The enumeration problem for cellular subrings of a given cellular ring has found numerous applications in combinatorics and graph theory (see for example [17], [22]). Usually one uses a computer to solve this problem. A general idea underlying searching algorithms for the enumeration of subrings was proposed in [19] and consists of the following.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
V.L. Arlazarov, A.M. Baraev, Ja. Ju. Gol’fand, I.A. Faradžev, Construction with the use of a computer of all latin squares of order 8, In “Algorithmic Investigations in Combinatorics”, pp. 129–141, Moscow, Nauka, 1978 [In Russian].
V.L. Arlazarov, A.A. Leman, M.Z. Rosenfeld, Construction and investigation of graphs on 25, 26 and 29 vertices by use of computer, Preprint, Institute of Management Problems, Moscow, 1975 [In Russian].
N.L. Biggs, Algebraic Graph Theory, Cambridge Univ. Press, Cambridge, 1974.
R.C. Bose, Strongly regular graphs, partial geometries and partially balanced designs, Pacific J. Math., 13 (1963), 389–419.
R.H. Bruck, Finite nets II, Uniqueness and embedding, Pacific, J. Math., 13 (1963), 421–457.
F.C. Bussemaker, J.J. Seidel, Symmetric Hadamard matrices of order 36, Ann. N.Y. Acad. Sci. 175 (1970), 66–79.
P.J. Cameron, J.H. van Lint, Graph Theory, Coding Theory and Block Designs, London Math. Soc. Lect. Note Ser., 19, 1980.
P. Delsarte, An algebraic approach to the association schemes of coding theory, Philips Research report suppl. 10, Eindhoven, 1973.
I.A. Faradžev, A program complex for computation in V-ring of permutation groups, In “Methods and Programs for Solution of Optimization Problems”, Part I, Novosibirsk, 1982, pp. 218–222 [In Russian].
I.A. Faradžev, Cellular subrings of the symmetric square of a cellular ring of rank 3 [In this volume].
I.A. Faradžev, M.H. Klin, M.E. Muzichuk, Cellular rings and groups of automorphisme of graphs [In this volume].
Ja. Ju. Gol’fand, M.H. Klin, On k-homogeneous graphs, In “Algorithmic Investigations in Combinatorics”, pp. 76–85, Nauka, Moscow, 1978 [In Russian].
F. Harary, Graph Theory, Addison-Wesley, 1969.
M.D. Hestenes, D.G. Higman, Rank 3 groups and strongly regular graphs, SIAM AMS Proceedings, Providence, 4 (1974) 141–160.
X.L. Hubant, Strongly regular graphs, Discrete Math., 13 (1975), 357–381.
I.V. Chuvaeva, A.A. Ivanov, Action of the group M 12 on Hadamard matrices [In this volume].
A.A. Ivanov, M.H. Klin, I.A. Faradžev, Primitive representations of the nonabelian simple groups of order less than 106, Preprint, Part II, Moscow, VNIISI, 1984 [In Russian].
A.K. Kelmans, Graphs with equal number of paths of length 2 between adjacent and nonadjacent vertices, In “Problems of cybernetics”, pp. 70–75, Moscow, 1973 [In Russian].
M.H. Klin, Computations in V-rings of permutation groups and their application in graph theory and combinatorics, In “Artificial Intellegence and Automatization of Investigations in Mathematics”, pp. 34–36, Kiev, 1978 [In Russian].
M. Markus, H. Mink, A survey of matrix theory and matrix inequalities, Boston, 1964.
D.M. Mesner, A new family of partially balanced incomplete block designs with some Latin square designs properties, The Annals of Math. Stat., 38 (1967), 571–581.
R. Pöschel, L.A. Kalužnin, Funktionen-und Relationenalgebren, Berlin, 1979.
S.S. Shrikhande, The uniqueness of the L 2 association scheme, Ann. Math. Statist. 30 (1959), 781–798.
S.S. Shrikhande, N. Bhat Vasante, Non-isomorphic solutions of pseudo-(3,5,2) and pseudo-(3,6,3) graphs, Annals of the New York Acad. Sci., 175 (1970), 331–350.
C.C. Sims, Computing methods in the study of permutation groups, In “Computing Problems in Abstract Algebra”, pp. 169–184, Pergamon Press, 1970.
B. Weisfeiler (editor), On construction and identification of graphs, Lect. Notes Math., No. 558, 1976.
H. Wielandt, Finite permutation groups, Acad. Press, 1964.
V.A. Zaichenko, An algorithmic approach to the synthesis of combinatorial objects and to computation in permutation groups based on the method of invariant relations,Ph. D. Thesis, 1981 [In Russian]..
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1994 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Gol’fand, J.J., Ivanov, A.V., Klin, M.H. (1994). Amorphic Cellular Rings. In: Faradžev, I.A., Ivanov, A.A., Klin, M.H., Woldar, A.J. (eds) Investigations in Algebraic Theory of Combinatorial Objects. Mathematics and Its Applications, vol 84. Springer, Dordrecht. https://doi.org/10.1007/978-94-017-1972-8_3
Download citation
DOI: https://doi.org/10.1007/978-94-017-1972-8_3
Publisher Name: Springer, Dordrecht
Print ISBN: 978-90-481-4195-1
Online ISBN: 978-94-017-1972-8
eBook Packages: Springer Book Archive