Algebraic combinatorics in mathematical chemistry. Methods and algorithms. I. Permutation groups and coherent (cellular) algebras

Match

Volumn 40, Issue , 1999, Pages 7-138

  Klin, Mikhail ^a   Rücker, Christoph ^b   Rücker, Gerta ^b   Tinhofer, Gottfried ^c  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

^b UNIVERSITY OF FREIBURG   (Germany)

^c TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0002261718     PISSN: 03406253     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (284)

1. Adel'son-Vel'skiǐ G.M.: Private communication, April 1995.
2. Adel'son-Vel'skiǐ G.M., Weisfeiler B.Ju., Leman A.A., Faradžev I.A.: On an example of a graph whose automorphism group is not transitive. DAN USSR 185, 1969, 975-976 (Russian).
3. Aigner M.: Combinatorial theory. Springer, Berlin, 1979.
4. Arlazarov V.L., Leman A.A., Rosenfeld M.Z.: Computer aided construction and analysis of graphs with 25, 26 and 29 vertices. Preprint. Moscow, IPU, 1975 (Russian).
5. Arlazarov V.L., Zuev I.I., Uskov A.V., Faradžev I.A.: An algorithm of reduction of finite undirected graphs to the canonical form. Zhurn. Vychisl. Mat. i Mat. Fis. 14, 1974, 737-743 (Russian).
6. Babai L.: Moderately exponential bound for graph isomorphism. Lecture Notes in Comput. Sci. 117, Springer, 1981, 34-50.
7. Babić D., Klein D.J., Sah C.H.: Symmetry of fullerenes. Chem. Phys. Lett. 211, 1993, 235-241.
8. Babel L., Chuvaeva I.V., Klin M., Pasechnik D.V.: Algebraic combinatorics in mathematical chemistry. Methods and Algorithms. II. Program implementation of the Weisfeiler - Leman algorithm. Preprint. TUM-M9701, Technische Universität München, 1997.
9. Babel L., Ponomarenko I.N., Tinhofer G.: Directed paths graph isomorphism. (Extended abstract.) In: Mayr E., Schmidt G., Tinhofer G. (eds.): Proc. 20th Int. Workshop on Graphtheoretical Concepts in Comput. Sci., Lecture Notes in Comput. Sci. 903, Springer 1995, 395-407.
10. Balaban A.T.: Valence-isomerism of cyclopolyenes. Rev. Roum. Chim. 11, 1966, 1097-1116.
11. Balaban A.T. (ed.): Chemical applications of graph theory. Academic Press, London, 1976.
12. Balaban A.T.: Chemical graphs XXX. Reaction graphs for degenerate rearrangements of homovalenium cations. Rev. Roum. Chim. 22, 1977, 243-255.
13. Balaban A.T.: Chemical graphs XXXII. Constitutional and steric isomers of substituted cycloalkanes. Croat. Chem. Acta 51, 1978, 35-42.
14. Balasubramanian K.: Recent applications of group theoretical generators to chemical physics. Croat. Chem. Acta 57, 1984, 1525-1552.
15. Balasubramanian K: Computer generation of distance polynomials of graphs. J. Comput. Chem. 11, 1990, 829-836.
16. Balasubramanian K.: Computational techniques for the automorphism groups of graphs. J. Chem. Inf. Comput. Sci. 34, 1994, 621-626.
17. Balasubramanian K.: Computer generation of automorphism groups of weighted graphs. J. Chem. Inf. Comput. Sci. 34, 1994, 1146-1150.
18. Balasubramanian K.: Computer generation of nuclear equivalenve classes based on the three-dimensional molecular structure. J. Chem. Inf. Comput. Sci. 35, 1995, 243-250.
19. Balasubramanian K.: Combinatorics and spectroscopy. In: Bonchev D., Rouvray D.H. (eds.): Chemical Group Theory. Techniques and Applications. Gordon and Breach, 1995.
20. Balaban A.T., Mekenyan O., Bonchev D.: Unique description of chemical structures based on hierarchically ordered extended connectivities (HOC procedures). I. Algorithms for finding graph orbits and canonical numberings of atoms. J. Comput. Chem. 6, 1985, 538-551.
21. Bannai E.: Subschemes of some association schemes. J. Algebra 144, 1991, 167-188.
22. Bannai E., Ito T.: Algebraic combinatorics I. Association schemes. Benjamin/Cummings, Menlo Park, 1984.
23. Bangov I.P. : Structure generation from a gross formula. 7. Graph isomorphism: a consequence of the vertex equivalence. J. Chem. Inf. Comput. Sci. 34, 1994, 318-324.
24. Baraev A.M., Faradžev I.A.: Construction and investigation on a computer of regular and regular bipartite graphs. In: Faradžev I.A. (ed.): Algorithmic investigations in combinatorics. NAUKA, Moscow, 1978, 25-60 (Russian).
25. Berlekamp E.R., Van Lint J.H., Seidel J.J.: A strongly regular graph derived from the perfect ternary Golay code. In: Srivastava J.N. et al. (eds.): A survey of combinatorial theory. North-Holland, Amsterdam, 1973, 25-30.
26. Bersohn M.: A matrix method for partitioning the atoms of a molecule into equivalence classes. Comput. Chem. 11, 1987, 67-72.
27. Biess G., Bautz M.: A heuristical polynomial algorithm for orbits of nondirected, connected finite digraphs with at least two vertices. MATCH 28, 1992, 29-43.
28. Biggs N.: Algebraic graph theory. Cambridge University Press, Cambridge, 1974.
29. Biggs N.: Automorphic graphs and the Krein condition. Geom. Dedic. 5, 1976, 117-127.
30. Biggs N. L.: Discrete Mathematics. Clarendon Press, Oxford, 1985.
31. Biggs N.L., Lloyd E.K., Wilson R.J.: Graph theory 1736-1936. Clarendon Press, Oxford, 1976.
32. Bishop D.M.: Group theory and chemistry. Clarendon Press, Oxford, 1973.
33. Björner A., Las Vergnas M., Sturmfels B., White N., Ziegler G.M.: Oriented matroids. Encyclopedia of Mathematics Series, 46, Cambridge University Press, 1993.
34. Bodnarchuk V.G., Kalužnin, Kotov V.N., Romov B.A.: Galois theory for Post algebras I,II. Kibernetika 3, 1969, 1-10; 5, 1969, 1-9 (Russian).
35. Bodnarchuk V.G., Kalužnin, Kotov V.N., Romov B.A.: Galois theory for Post algebras I,II. Kibernetika 3, 1969, 1-10; 5, 1969, 1-9 (Russian).
36. Bonchev D., Mekenyan O., Balaban A.T.: Unique description of chemical structures based on hierarchically ordered extended connectivities IV. Recognition of graph isomorphism and graph symmetries. MATCH 18, 1985, 83-99.
37. Bonchev D., Rouvray D.H. (eds.): Chemical graph theory, Introduction and Fundamentals. Gordon and Breach, N.Y., 1991.
38. Bonchev D., Rouvray D.H. (eds.): Chemical graph theory. Reactivity and Kinetics. Gordon and Breach, N.Y., 1992.
39. Bose R.C.: Strongly regular graphs, partial geometries and partially balanced designs. Pacific J. Math. 13, 1963, 389-419.
40. Bose R.C., Nair K.R.: Partially balanced block designs. Sankhya 4, 1939, 337-372.
41. Bose R.C., Shimamoto T.: Classification and analysis of partially balanced incomplete block designs with two associate classes. J. Amer. Stat. Ass. 47, 1952, 151-184.
42. Bose R.C., Clatworthy W.H., Shrikhande S.S.: Tables of partially balanced incomplete block designs with two associate classes. North Carolina Agricultural Experimental Station Technical Bulletin No. 107, 1954.
43. Bose R.C., Mesner D.M.: On linear associative algebras corresponding to association schemes of partially balanced designs. Ann. Math. Stat. 30, 1959, 21-38.
44. Brocas J.: Double cosets and enumeration of permutational isomers of fixed symmetry. J. Am. Chem. Soc. 108, 1986, 1135-1145.
45. Brocas J.: The reaction graph of the Cope rearrangement in bullvalene. J. Math. Chem. 15, 1994, 389-395.
46. Brocas J., Gielen M., Willem R.: The permutational approach to dynamic stereochemistry. McGraw-Hill, N.Y., 1983.
47. Brown H., Hjelmeland H., Masinter L.: Constructive graph labeling using double cosets. Discrete Math. 7, 1974, 1-30.
48. Brouwer A.E., Cohen A.M., Neumaier A.: Distance regular graphs. Springer, Berlin, 1989.
49. Brouwer A.B., Ivanov A.A., Klin M.H.: Some new strongly regular graphs. Combinatorica 9, 1989, 339-344.
50. Brouwer A.E., van Lint J.H.: Strongly regular graphs and partial geometries. In: Jackson D.M., Vanstone S.A. (eds.): Enumerating and Design. Proceedings Silver Jubilee Conference on Combinatorics, Academic Press, 1984, 85-122.
51. Brown H., Masinter L.: An algorithm for the construction of the graphs of organic molecules. Discrete Math. 8, 1974, 227-244.
52. Bures M.G., Martin Y.C., Willet P.: Searching techniques for databases of three-dimensional chemical structures. Top. Stereochem. 21, 1994, 467-511.
53. Butler G., Lam C.W.H.: A general backtrack algorithm for the isomorphism problem of combinatorial objects. J. Symb. Comp. 1, 1985, 363-381.
54. Cai J.Y., Fürer M., Immerman N.: An optimal lower bound on the number of variables for graph identification. Combinatorica 12, 1992, 389-410.
55. Cameron P.: Suborbits in transitive permutation groups. Math. Centre Tracts 57, 1974, 98-129.
56. Cameron P.J., Goethals J.M., Seidel J.J.: Strongly regular graphs having strongly regular subconstituents. J. Algebra 55, 1978, 257-280.
57. Carhart R.E., Smith D.H., Venkataraghavan R.: Atom pairs as molecular features in structure-activity studies: definition and applications. J. Chem. Inf. Comput. Sci. 25, 1985, 64-73.
58. Cayley A.: On the analytical forms called trees, with application to the theory of chemical combinations. Rep. Brit. Assoc. Adv. Sci., 45, 1875, 257-305 = Math. Papers, v. 9, 427-460. Abridged version: Ber. Dt. Chem. Ges. 8, 1875, 1056-1059.
59. Cayley A.: On the analytical forms called trees, with application to the theory of chemical combinations. Rep. Brit. Assoc. Adv. Sci., 45, 1875, 257-305 = Math. Papers, v. 9, 427-460. Abridged version: Ber. Dt. Chem. Ges. 8, 1875, 1056-1059.
60. Cayley A.: On the analytical forms called trees, with application to the theory of chemical combinations. Rep. Brit. Assoc. Adv. Sci., 45, 1875, 257-305 = Math. Papers, v. 9, 427-460. Abridged version: Ber. Dt. Chem. Ges. 8, 1875, 1056-1059.
61. Cauchy A.L.: Note sur un théorème fondamental relatif à deux systèmes de substitutions conjugées. Comptes Rendus 22, 1846, 630-632.
62. Chang L.G.: The uniqueness and non-uniqueness of the triangular association schemes. Science Record 3, 1959, 604-613.
63. 11 = 4. Science Record 4, 1960, 12-18.
64. Clathworthy W.H.: Contributions on partially balanced incomplete block designs with two associate classes. National Bureau of Standards Applied Math. Series, No. 47, 1956.
65. Cornell D.G., Mathon R.A.: Algorithmic techniques for the generation and analysis of strongly regular graphs and other combinatorial configurations. Ann. Discr. Math. 2, 1978, 1-32.
66. Cotton F. A.: Chemical applications of group theory, 3rd ed. Wiley - Interscience, N.Y., 1990.
67. Crum Brown A.: On the theory of isomeric compounds. Trans. Roy. Soc. Edinb. 23, 1864, 707-719.
68. Cvetković D.M., Doob M., Sachs H.: Spectra of graphs. Theory and applications. Academic Press, N.Y., 1980.
69. Davidson R. A.: Spectral analysis of graphs by cyclic automorphism subgroups. Theoret. Chim. Acta 58, 1981, 193-231.
70. Delsarte P.: An algebraic approach to the association schemes of coding theory. Philips research reports supplements, No.10, Eindhoven, 1973.
71. Dembowski P.: Finite geometries. Springer, Berlin, 1968.
72. Dress A.: Some suggestions concerning a geometric definition of the symmetry group of non-rigid molecules. In: [Hin79], 77-91.
73. Dugundji J., Kopp R., Marquarding D., Ugi I.: Perspectives in theoretical stereochemistry. Lecture Notes in Chem. 36, Springer, Berlin, 1984.
74. Dugundji J., Ugi I.: An algebraic model of constitutional chemistry as a basis for chemical computer programs. Top. Curr. Chem. 39, 1973, 19 - 64.
75. Eaton P.E.: Cubanes: Starting materials for the chemistry of the nineties and the next century. Angew. Chem., Int. Ed. Engl. 31, 1992, 1421-1436.
76. Eaton P.E., Or Y.S., Branca S.J.: Pentaprismane. J. Am. Chem. Soc. 103, 1981, 2134-2136.
77. Ezra G.S.: Symmetry properties of molecules. Lecture Notes in Chem. 28, Springer, Berlin, 1982.
78. Faradžev I.A.(ed.): Algorithmic investigations in combinatorics. Moscow, Nauka, 1978 (Russian).
79. Faradžev I.A., Ivanov A.A., Klin M.H.: Galois correspondences between permutation groups and cellular rings (association schemes). Graphs and Combinatorics 6, 1990, 303-332.
80. Faradžev I.A., Ivanov A.A., Klin M.H., Pasechnik D.V.: Cellular subrings of Cartesian products of cellular rings. Proc. Intern. Workshop on algebraic and combinatorial coding theory, Sofia, Informa, 1988, 58-62.
81. Faradžev I.A., Klin M.H.: Computer package for computations with coherent configurations. Proc. ISSAC-91, Bonn, ACM Press, 1991, 219-223.
82. Faradžev I.A., Klin M.H., Muzichuk M.E.: Cellular rings and groups of automorphisms of graphs. In: Faradžev LA. et al. (eds.): Investigations in algebraic theory of combinatorial objects. Kluwer Acad. Publ., Dordrecht, 1994, 1-152.
83. Faulon J.-L.: Isomorphism, automorphism partitioning and canonical labeling can be solved in polynomial time for molecular graphs. J. Chem. Inf. Comput. Sci. 38, 1998, 432-444.
84. Feller W.: An introduction to probability theory and its applications. 2nd edition, Wiley, New York, 1957.
85. Fisher R.A.: The design of experiments. Oliver & Boyd. Edinburgh, 1935 (8th edition 1966).
86. Flapan E.: Symmetries of Moebius ladders. Math. Ann. 283, 1989, 271-283.
87. Frame J.S.: The double cosets of a finite group. Bull. Amer. Math. Soc. 47, 1941, 458-467.
88. Frame J.S.: Group decomposition by double coset matrices. Bull. Amer. Math. Soc. 54, 1948, 740-755.
89. Frame J.S.: Properties of double cosets with applications to theoretical chemistry. In: [Hin79], 193-214.
90. Friedland S.: Coherent algebras and the graph isomorphism problem. Discrete Applied Math. 25, 1989, 73-98.
91. Fürer M.: A counterexample in graph isomorphism testing. Preprint CS-87-36. Department of Computer Science. The Pennsylvania State University, University Park, 1987.
92. Fürer M., Schnyder W., Specker E.: Normal forms for trivalent graphs and graphs of bounded valence. Proc. of 15th annual ACM STOC, 1983, ACM, 161-170.
93. Fujita S.: Symmetry and combinatorial enumeration in chemistry. Springer, Berlin, 1991.
94. Gati G.: Further annotated bibliography on the isomorphism disease. J. Graph. Th. 3, 1979, 95-109.
95. Godsil C.D.: Algebraic combinatorics. Chapman & Hall, New York, 1993.
96. Goethals J.M., Seidel J.J.: Strongly regular graphs derived from combinatorial designs. Can. J. Math. 22, 1970, 597-614.
97. Gorenstein D.: Finite simple groups. An introduction to their classification. Plenum Press, New York, 1982.
98. Gray N.A.B.: Computer-assisted structure elucidation. Wiley-Interscience, N.Y., 1986.
99. Grund R., Kerber A., Laue R.: MOLGEN, ein Computeralgebra-System für die Konstruktion molekularer Graphen. MATCH 27, 1992, 87-131.
100. Günther H.: NMR Spectroscopy. Wiley, Chichester, 1985.
101. Gutman I., Polansky O.E.: Mathematical concepts in organic chemistry. Springer, Berlin, 1986.
102. Guy R.K., Harary F.: On the Möbius ladders. Can. Math. Bull. 10, 1967, 493-496.
103. Hall M., Jr.: The Theory of Groups. Macmillan, N.Y., 1959.
104. Hall L.H.: Group theory and symmetry in chemistry. McGraw-Hill, N. Y., 1969.
105. Hall L.H., Kier L.B.: Determination of topological equivalence in molecular graphs from the topological state. Quant. Struct. - Act. Relat. 9, 1990, 115-131.
106. Hammermesh M.: Group theory and its application to physical problems. Addison-Wesley, Reading, 1962.
107. Harary F.: Graph theory. Addison-Wesley, Reading, 1969.
108. Hargittai I., Hargittai M.: Symmetry through the eyes of a chemist. VCH, Weinheim, 1986.
109. Harary F., Palmer E.M.: Graphical enumeration. Academic Press, N.Y., 1973.
110. Hässelbarth W.: On the interrelation between orbits and double cosets. Theor. Chem. Acta 67, 1985, 427-437.
111. Hässelbarth W., Ruch E. : Classifications of rearrangement mechanisms by means of double cosets and counting formulas for the number of classes. Theoret. Chim. Acta 29, 1973, 259-268.
112. Hässelbarth W., Ruch E., Klein D.J., Seligman T.H.: Bilateral classes: A new class concept of group theory. MATCH 7, 1979, 341-348.
113. Hecke E.: Über Modulfuntionen und die Dirichletschen Reihen mit Eulerscher Produktentwicklung. I.II. Math. Ann. 114, 1937, 1-28, 316-351.
114. Hestenes M.D., Higman D.G.: Rank 3 groups and strongly regular graphs. SIAM-AMS Proc. 4, 1971, 141-159.
115. Higman D.G., Sims Ch.C.: A simple group of order 44 352 000. Math. Z. 105, 1968, 110-113.
116. Higman D.G.: Finite permutation groups of rank 3. Math. Z. 86, 1964, 145-156.
117. Higman D.G.: Intersection matrices for finite permutation groups. J. Algebra 6, 1967, 22-42.
118. Higman D.G.: Coherent configurations. I. Rend. Sem. Mat. Univ. Padova 44, 1970, 1-25.
119. Higman D.G.: Combinatorial considerations about permutation groups. Mathematical Institute Oxford, 1972.
120. Higman D.G.: Invariant relations, coherent configurations and generalised polygons. Math. Centre Tracts 57, 1974, 27-43.
121. Higman D.G.: Coherent configurations. Part I: Ordinary representation theory. Geom. Dedic. 4, 1975, 1-32.
122. Higman D.G.: Lectures on permutation representations. Notes taken by W. Hauptmann. Vorlesungen aus dem Math. Inst. Giessen, 4, 1977.
123. Higman D.G.: Coherent algebras. Linear Algebra Appl. 93, 1987, 209-239.
124. Higman D.G.: Computations related to coherent configurations. Congr. Numer. 75, 1990, 9-20.
125. Hinze J.(ed.): The permutation group in physics and chemistry. Lecture Notes in Chemistry 12, Springer, Berlin, 1979.
126. Hinteregger J., Tinhofer G.: Zerlegung der Knotenmengen von Graphen zum Nachweis der Isomorphie. Computing 18, 1977, 351-359.
127. Hochstrasser R.M.: Molecular aspects of symmetry. W. A. Benjamin, Inc. N.Y.-Amsterdam, 1966.
128. Hoffman A.J.: On the uniqueness of the triangular association scheme. Annals Math. Stat. 31, 1960, 492-497.
129. Hoffmann CM.: Group-theoretic algorithms and graph isomorphism. Lecture Notes in Comput. Sci. 136, Springer, Berlin, 1982.
130. Hubaut X.L.: Strongly regular graphs. Discrete Math. 13, 1975, 357-381.
131. Hu C.Y., Xu L.: Algorithm for computer perception of topological symmetry. Anal. Chim. Acta 295, 1994, 127-134.
132. Ihlenfeldt W.-D., Gasteiger J.: Computer-aided planning of organic-chemical syntheses: The second generation. Angew. Chem., Int. Ed. Engl. 34, 1995 .
133. Ivanov A.A.: Bounding the diameter of a distance-regular graph. Soviet Math. Dokl. 28, 1983, 149-152.
134. Ivanov A.V.: On rank 3 graphs with 5-vertex condition. Math. Forschungsinstitut Oberwolfach, Tagungsbericht 24, 1987, 8-9.
135. Ivanov A.V.: Non rank 3 strongly regular graphs with the 5-vertex condition. Combinatorica 9, 1989, 255-260.
136. Johnson M.A., Maggiora G.M. (eds.): Concepts and applications of molecular similarity. Wiley-Interscience, N.Y., 1990.
137. Jones G.A., Lloyd E.K.: The automorphism groups of some chemical graphs. In: King R.B. (ed.): Chemical applications of topology and graph theory. Elsevier, Amsterdam, 1983, 252-267.
138. Kageyama S., Saha G.M.: Note on the construction of optimum chemical balance weighing designs. Annals Inst. Stat. Math. 35, 1983, 447-452.
139. Kageyama S.: Optimum chemical balance weighing designs for estimating the total weight. Commun. Statist. Theory Meth. 17, 1988, 2697-2704.
140. Kalužnin L.A., Klin M.H.: On some maximal subgroups of symmetric and alternating groups. Mat. Sbornik 87, 1972, 91-121 (Russian).
141. Kalužnin L.A., Pöschel R.: Zur Darstellung und Behandlung Algebraisch-Kombinatorischer Objekte. EIK 22, 1986, 5-24.
142. Kerber A., Lehmann W.: On graphs and their enumeration III. MATCH 3, 1977, 67-86.
143. Kerber A.: Algebraic combinatorics via finite group actions. BI-Wiss.-Verl., Mannheim, 1991.
144. Kerber A., Laue R.: Group actions, double cosets and homomorphisms: unifying concepts for the constructive theory of discrete structures. Acta Appl. Math. 52, 1998, 63-90.
145. Kerber A., Laue R., Moser D.: Ein Strukturgenerator für molekulare Graphen. Anal. Chim. Acta. 235, 1990, 221-228.
146. Kier L.B., Hall L.H.: Molecular connectivity in structure-activity analysis. Research Studies Press, Letchworth, 1986.
147. Klein D.J., Liu X.: Elemental carbon isomerism. Int. J. Quant. Chem.: Quant. Chem. Symp. 28, 1994, 501-523.
148. Klin M.H.: On the number of graphs whose automorphism group is a given permutation group. Kibernetica (Kiev) 6, 1970, 131-137 (Russian).
149. Klin M.H.: On an infinite family of maximal subgroups of symmetric groups. Trudy Nikolaevskogo korablestroitel'nogo instituta 41, 1970, 148-151 (Russian).
150. Klin M.H.: V-rings and their connection with automorphism groups of binary relations. Matematicheskie issledovaniya (Kishinev) 7, 1972, 204-205 (Russian).
151. Klin M.H.: Investigations of the algebras of invariant relations of some classes of permutation groups. Ph. D. thesis, Nikolaev, NKI, 1974 (Russian).
152. Klin M.H.: Computations in V-rings of permutation groups and their applications in graph theory and combinatorics. In: All Union Symposium on Artificial Intelligence and Automation of Investigations in Mathematics. Kiev, IK AN Ukr. SSR, 1978, 34-36 (Russian).
153. Klin M.H.: On axiomatics of cellular rings. In: Klin M.H., Faradžev I.A.(eds.): Investigations in algebraic theory of combinatorial objects. Proceedings of the Seminar. Moscow, VNIISI, 1985, 6-32 (Russian).
154. Klin M.H., Faradžev I.A.: The method of V-rings in permutation group theory and its combinatorial applications. In: Alekseev A.S. (ed.): Investigations in applied graph theory. Novosibirsk, Nauka, 1986, 59-97 (Russian).
155. Klin M.H., Krukovskaya E.V., Zefirov N.S.: Investigation of the automorphism groups of some chemical graphs by means of the method of cellular rings. In: Molecular graphs in chemical investigations. Abstracts of the Conference. Kalinin, May 21-26, 1990. Kalinin State University, 1990, 34-35 (Russian).
156. Klin M.H., Lebedev O.V., Pivina T.S.: Enumeration of cycles of maximal length in graphs corresponding to structural formulas of homological series of polycyclic compounds of carcass type. Vychislitelnye sistemy (Novosibirsk), 130, 1989, 39-67 (Russian).
157. Klin M.H., Lebedev O.V., Pivina T.S., Zefirov N.S.: Nonisomorphic cycles of maximum length in a series of chemical graphs and the problem of application of IUPAC nomenclature rules. MATCH 27, 1992, 133-151.
158. Klin M.H., Pöschel R.: The König problem, the isomorphism problem for cyclic graphs and the method of Schur rings. In: Algebraic methods in graph theory, Szeged (Hungary, Coll. Math. Soc. J. Bolyai 25, 1981, 405 - 434.
159. Klin M.H., Pöschel R., Rosenbaum K.: Angewandte Algebra. Vieweg, Braunschweig, 1988.
160. p). Reports in Mol. Theory 1, 1990, 149-163.
161. Klin M.H., Traten S.S., Zefirov N.S.: Group-theoretical approach to the investigation of reaction graphs for highly degenerate rearrangements of chemical compounds. I. Criterion of the connectivity of a graph. J. Math. Chem. 7, 1991, 135-151.
162. Klin M.H., Zefirov N.S.: Group-theoretical approach to the investigation of reaction graphs for highly degenerate rearrangements of chemical compounds II. Fundamental concepts. MATCH 26, 1991, 171-190.
163. Knapp W.: On the point stabilizer in a primitive permutation group. Math. Z. 133, 1973, 137-168.
164. Kochendörffer R.: Lehrbuch der Gruppentheorie unter besonderer Berücksichtigung der endlichen Gruppen. Akad. Verlagsgesellschaft Geest & Portig, Leipzig, 1966.
165. Krasner M.: Une généralisation de la notion de corps. J. Math. pure et appl. 17, 1938, 367-385.
166. Kuznetsov O.P., Adel'son-Vel'skiǐ G.M.: Discrete mathematics for engineers. Gordon and Breach, N.Y., 1985.
167. Kvasnička V., Pospichal J.: Graph-theoretical interpretation of Ugi's concept of the reaction network. J. Math. Chem. 5, 1990, 309-322.
168. Laidboeur T., Cabrol-Bass D., Ivanciuc O.: Determination of topogeometrical equivalence classes of atoms. J. Chem. Inf. Comput. Sci. 37, 1997, 87-91.
169. Lam C.W.H., Thiel L.: Backtrack search with isomorphism rejection and consistency check. J. Symbolic Computations 7, 1989, 473-485.
170. Leman A.A.: On automorphisms of certain classes of graphs. Avtomatika i Telemehanika 2, 1970, 75-82 (Russian). Engl. Translation: Automat. Remote Control 2, 1970, 235-242.
171. Leman A.A.: On automorphisms of certain classes of graphs. Avtomatika i Telemehanika 2, 1970, 75-82 (Russian). Engl. Translation: Automat. Remote Control 2, 1970, 235-242.
172. Leon J.S.: Computing automorphism groups of combinatorial objects. In: Atkinson M.D. (ed.): Computational group theory (Durham 1982). Academic Press, London, 1984, 321-335.
173. Levi F.W.: Geometrische Konfigurationen. Hirzel, Leipzig, 1929.
174. Levi F.W.: Finite geometrical systems. Six public lectures delivered in February, 1940, at the University of Calcutta. University of Calcutta, 1942.
175. Van Lint J.H., Wilson R.M.: A course in combinatorics. Cambridge University Press, Cambridge, 1992.
176. Liu X., Balasubramanian K., Munk M.E.: Computational techniques for vertex partitioning of graphs. J. Chem. Inf. Comp. Sci. 30, 1990, 263-269.
177. 13C NMR signal and intensity patterns. J. Magnet. Reson. 87, 1990, 457-474.
178. Liu X., Klein D.J.: The graph isomorphism problem. J. Comput. Chem. 12, 1991, 1243-1251.
179. Lloyd E.K.: Marks of permutation groups and isomer enumeration. J. Math. Chem. 11, 1992, 207-222.
180. Lloyd E.K., Jones C.A.: Reaction graphs. Acta Appl. Math. 52, 1998, 121-147.
181. Longuet-Higgins H.C.: The symmetry groups of non-rigid molecules. Mol. Phys. 6, 1963, 445-460.
182. Luks E.M.: Isomorphism of graphs of bounded valence can be tested in polynomiaJ time. J. Comput. Sys. Sci. 25, 1982, 42-65.
183. Lunn A.C., Senior J.K.: Isomerism and configuration. J. Phys. Chem. 33, 1929, 1027-1079.
184. MacWilliams F.J., Sloane N.J.A.: The theory of error-correcting codes. North-Holland, Amsterdam, 1978.
185. Manning W.A.: On transitive groups that contain certain transitive subgroups. Bull. Amer. Math. Soc. 45, 1939, 783-791.
186. Mathon R.: Sample graphs for isomorphism testing. Proc. 9th S.-E. Conf. Combinatorics, Graph Theory and Computing 1978, 499-517.
187. Mathon R.: A note on the graph isomorphism counting problem. Inform. Process. Lett. 8, 1979, 131-132.
188. McKay B.D.: Practical graph isomorphism. Congressus Numerantium. 30, 1981, 45 - 87.
189. McKay B.D.: Nauty user's guide (version 1.5). Technical Report TR-CS-90-02. Dept. Comput. Sci., Australian National University, 1990.
190. Mekenyan O., Bonchev D., Balaban A.T.: Unique description of chemical structures on hierarchically ordered extended connectivities (HOC procedures). II. Mathematical proofs for the HOC algorithm. J. Comput. Chem. 6, 1985, 552-561.
191. Merrifield R.E., Simmons H.E.: Topological methods in chemistry. Wiley-Interscience, N.Y., 1989.
192. Mezey P.G.: Reaction topology: manifold theory of potential surfaces and quantum chemical synthesis design. In: King R. B. (ed.): Chemical applications of topology and graph theory. Elsevier, Amsterdam, 1983, 75-98.
193. Molodtsov S.G.: Computer - aided generation of molecular graphs. MATCH 30, 1994, 213-224.
194. Morgan H.L.: The generation of a unique machine description for chemical structures - A technique developed at Chemical Abstracts Service. J. Chem. Doc. 5, 1965, 107-113.
195. Nagle J.F.: On ordering and identifying undirected linear graphs. J. Math. Phys. 7, 1966, 1588-1592.
196. Neumann P.M.: Finite permutation groups, edge-colored graphs and matrices. In: Curran M.P.J.(ed.): Topics in group theory and computation. Academic Press, London, 1977, 82-118.
197. Ojha P.C.: Analysis of degeneracy in the spectrum of a class of molecular graphs. Int. J. Quant. Chem. 35, 1989, 687-700.
198. 2n-1 (4n - 1). Acta Appl. Math. 29, 1992, 129-138.
199. Pólya G.: Kombinatorische Anzahlbestimmungen für Gruppen, Graphen und chemische Verbindungen. Acta Math. 68, 1937, 145-254.
200. Ponomarenko I.: Cellular algebras and the graph isomorphism problem. Research Report No. 8592-CS, Institut für Informatik der Universität Bonn, 1993.
201. Pöschel R., Kalužnin L.A.: Funktionen- und Relationenalgebren. Ein Kapitel der Diskreten Mathematik. Birkhäuser, Basel, 1979.
202. Prelog V.: Chirality in chemistry. J. Mol. Cat. 1, 1976, 159-172.
203. Quirin W.L.: Extension of some results of Manning and Wielandt on primitive permutation groups. Math. Z. 123, 1971, 223-230.
204. Randić M.: On the recognition of identical graphs representing molecular topology. J. Chem. Phys. 60, 1974, 3920-3928.
205. Randić M.: On canonical numbering of atoms in a molecule and graph isomorphism. J. Chem. Inf. Comput. Sci. 17, 1977, 171-180.
206. Randić M., Brissey G.M., Wilkins C.L.: Computer perception of topological symmetry via canonical numbering of atoms. J. Chem. Inf. Comput. Sci. 21, 1981, 52-59.
207. Randić M., Klein D.J., Katović V., Oakland D.O., Seitz W.A., Balaban A.T.: Symmetry properties of chemical graphs, X. Rearrangement of axially distorted octahedra. In: King R.B., Rouvray D.H. (eds.): Graph theory and topology in chemistry. Elsevier, Amsterdam, 1987, 266-284.
208. Randić M., Trinajstić N.: Notes on some less known early contributions to chemical graph theory. Croat. Chem. Acta 67, 1994, 1-35
209. Razinger M., Balasubramanian K., Munk M.E.: Graph automorphism perception algorithms in computer-enhanced structure elucidation. J. Chem. Inf. Comput. Sci. 33, 1993, 197-201.
210. Read R.C., Corneil D.G.: The graph isomorphism disease. J. Graph Th. 1, 1977, 339-363.
211. Redfield J.H.: The theory of group-reduced distributions. Amer. J. Math. 49, 1927, 433-455.
212. Reid K.B., Brown E.: Doubly regular tournaments are equivalent to skew Hadamard matrices. J. Comb. Th. A12, 1972, 332-338.
213. Rosenblit A.B., Golender V.E.: Logical - combinatorial methods in drug design. Riga, Zitnatne, 1983 (Russian).
214. Rouvray D.H. (ed.): Computational chemical graph theory. Nova Science, N.Y., 1990.
215. Ruch E., Klein D.J.: Double cosets in chemistry and physics. Theoret. Chim. Acta 63, 1983, 447-472.
216. Rücker G., Rücker Ch.: Nomenclature of organic polycycles out of the computer - How to escape the jungle of the secondary bridges. Chimia 44, 1990, 116-120.
217. Rücker G., Rücker Ch.: Computer perception of constitutional (topological) symmetry: TOPSYM, a fast algorithm for partitioning atoms and pairwise relations among atoms into equivalence classes. J. Chem. Inf. Comput. Sci. 30, 1990, 187-191.
218. Rücker G., Rücker Ch.: On using the adjacency matrix power method for perception of symmetry and for isomorphism testing of highly intricate graphs. J. Chem. Inf. Comput. Sci. 31, 1991, 123-126.
219. Rücker G., Rücker Ch.: Isocodal and isospectral points, edges and pairs in graphs and how to cope with them in computerized symmetry recognition. J. Chem. Inf. Comput. Sci. 31, 1991, 422-427.
220. Rücker G., Rücker Ch.: Counts of all walks as atomic and molecular descriptors. J. Chem. Inf. Comput. Sci. 33, 1993, 683-695.
221. 6,8]octane (Octabisvalene). J. Am. Chem. Soc. 110, 1988, 4828-4829.
222. Schonland D.: Molecular symmetry. Van Nostrand, London, 1965.
223. 2 association scheme. Annals Math. Stat. 30, 1959, 781-798.
224. Schur I.: Zur Theory der einfach transitiven Permutationsgruppen. Sitzungsberichte der Preussischen Akademie der Wissenschaften. Physikalisch-Mathematische Klasse, 1933, 598-623.
225. Scott W.R.: Group Theory. Prentice-Hall, Englewood Cliffs, 1964.
226. 2-type and of triangular type. Indag. Math. 29, 1967, 188-196.
227. Seidel J. J.: Strongly regular graphs with (-1,1,0) adjacency matrix having eigenvalue 3. Linear Alg. Appl. 1, 1968, 281-298.
228. Seidel J.J.: Strongly regular graphs. In: Tutte W.T. (ed.): RecentProgress in Combinatorics. Academic Press, N.Y., 1969, 185-197.
229. Seidel J. J.: A survey of two-graphs. Proc. Int. Coll. Teorie Comb. (Roma 1973). Accad. Naz. Lincei, Roma, 1976, 481-511.
230. Sims Ch.C.: Graphs and finite permutation groups. I. II. Math. Z. 95, 1967, 76-86; 103, 1968, 276-281.
231. Sims Ch.C.: Graphs and finite permutation groups. I. II. Math. Z. 95, 1967, 76-86; 103, 1968, 276-281.
232. Sims Ch.C.: Computational methods in the study of permutation groups. In: Computational Problems in abstract algebra. Pergamon Press, 1978, 169-184.
233. Sims Ch.C.: Computations with permutation groups. In: Petrick S.R. (ed.): Proc. Second Symp. on Symb. and Alg. Manip. ACM, New York, 1971, 23-28.
234. Sims Ch.C.: Some group-theoretical algorithms. Lect. Notes in Math. 697, 1978, 108-124.
235. Simon J.: Topological chirality of certain molecules. Topology 25, 1986, 229-235.
236. Skorobogatov V.A.: On the determination of isomorphism of nonoriented graphs. Vychisl. Sistemy 33, 1969, 34-36 (Russian).
237. Smith D.H. (ed.): Computer-assisted structure elucidation. ACS symposium series 54, Washington, 1977.
238. Stanley R.P.: Enumerative combinatorics. Wadsworth & Brooks, Monterey, 1986.
239. Stankevitch M.I., Tratch S.S., Zefirov N.S.: Combinatorial models and algorithms in chemistry. Search for isomorphisms and automorphisms of molecular graphs. J. Comput. Chem. 9, 1988, 303-314.
240. Sushchanskii V.I, Klin M.H., Lazebnik F.G., Pöschel R., Ustimenko V.A., Vyshenskii V.A.: Lev Arkad'evich Kalužnin (1914-1990). Acta Appl. Math. 52, 1998, 5-18.
241. Sylvester J.J.: Chemistry and algebra. Nature 17, 1878, 284.
242. Tamaschke O.: S-rings and the irreducible representations of finite groups. J. Algebra 1, 1964, 215-232.
243. Tamaschke O.: On permutation groups. Annali di Matematica (IV) 80, 1968, 235-279.
244. Tamaschke O.: Schur-Ringe. BI-Hochschulskripten 735a, Mannheim, 1970.
245. Thompson W.A., Jr.: A note on partially balanced incomplete block design matrices. Ann. Math. Stat. 29, 1958, 919-922.
246. Tinhofer G.: Zur Bestimmung der Automorphismen eines endlichen Graphen. Computing 15, 1975, 147-156.
247. Tinhofer G.: Zum algorithmischen Nachweis der Ismorphie von endlichen
248. Tinhofer G.: Graph isomorphism and theorems of Birkhoff type. Computing 36, 1986, 285-300.
249. Tinhofer G.: A note on compact graphs. Discrete Appl. Math. 30, 1991, 253-264.
250. Tratch S.S.: Mathematical models in stereochemistry I. Combinatorial characteristics of the composition, connectivity and configuration of organic molecules. Zh. Org. Khim. 31, 1995, 1320-1351 (Russian).
251. Tratch S.S., Zefirov N.S.: Combinatorial models and algorithms in chemistry. The ladder of combinatorial objects and its application to the formalization of structural problems in organic chemistry. In: Stepanov N.F. (ed.): Principles of symmetry and systemology in chemistry. Moscow State University, 1987, 54-86 (Russian).
252. Trindle C.: Application of the MuMATH(R) symbol manipulation system to chemically significant permutation groups. J. Symb. Comp. 2, 1986, 207-212.
253. Trinajstić N.: Chemical graph theory. CRC press, Boca Raton, 2nd edition 1992.
254. Trinajstić N., Nicolić S., Knop J.V., Müller W.R., Szymanski K.: Computational Chemical Graph Theory. Ellis Horwood, N.Y., 1991.
255. Turner J.: Generalized matrix functions and the graph isomorphism problem. SIAM J. Appl. Math. 16, 1968, 520-526.
256. Uchino M. : Algorithms for unique and unambiguous coding and symmetry perception of molecular structure diagrams. I - III. J. Chem. Inf. Comput. Sci. 20, 1980, 116-120, 121-124, 124-127.
257. Uchino M.: Unique coding by the method of "orbit graphs". J. Chem. Inf. Comput. Sci. 22, 1982, 201-206.
258. Ugi L: Logic and order in stereochemistry. Chimia 40, 1986, 340-350.
259. Ugi I., Bauer J., Bley K., Dengler A., Dietz A., Fontain E., Gruber B., Herges R., Knauer M., Reitsam K., Stein N.: Computer-assisted solution of chemical problems - the historical development and the present state of the art of a new discipline of chemistry. Angew. Chem., Int. Ed. Engl. 32, 1993, 201-227.
260. Ugi I., Bauer J., Brandt J., Friedrich J., Gasteiger J., Jochum C., Schubert W.: New fields of application for computers in chemistry. Angew. Chem., Int. Ed. Engl. 18, 1979, 111-123.
261. Ugi I., Dugundji J., Kopp R., Marquarding D.: Perspectives in theoretical stereochemistry. Lecture Notes in Chemistry 36, Springer, Berlin, 1984.
262. Ugi I., Stein N., Knauer M., Gruber B., Bley K., Weidinger R.: New elements in the rewpresentation of the logical structure of chemistry by qualitative mathematical models and corresponding data structures. Top. Curr. Chem. 166, 1993, 199-233.
263. Unger S.H.: GIT - a heuristic program for testing pairs of directed line graphs for isomorphism. Comm. ACM 7, 1964, 26-34.
264. Ustimenko V.A.: On p-local analysis of permutation groups. In: Faradžev I.A., Ivanov, A.A., Klin M.H., Woldar A.J. (eds.): Investigations in algebraic theory of combinatorial objects. Kluwer Acad. Publ., Dordrecht, 1994, 153-166.
265. Vollhardt K.P.C.: Organic Chemistry. Freeman, N.Y., 1987.
266. Walba D.M.: Topological stereochemistry. In: King R.B., Rouvray D.H.: (ed.): Graph Theory and Topology in Chemistry. Elsevier, Amsterdam, 1987, 23-42.
267. Walba D.M., Richards R.M., Haltiwanger R.C.: Total synthesis of the first molecular Möbius strip. J. Am. Chem. Soc. 104, 1982, 3219-3221.
268. Walba D.M., Simon J., Harary F.: Topicity of vertices and edges in Möbius ladders: A topological result with chemical implications. Tetrahedron Lett. 29, 1988, 731-734.
269. Weisfeiler B.Ju., Leman A.A.: Reduction of a graph to a canonical form and an algebra arising during this reduction. Naucho - Technicksagy Informatsia 9, Seria 2, 1968, 12-16 (Russian).
270. Weisfeiler B. (ed.): On construction and identification of graphs. Lecture Notes in Math. 558, Springer, Berlin, 1976.
271. Wielandt H.: Zur Theorie der einfach transitiven Permutationsgruppen. Math. Z. 40, 1936, 582-587.
272. Wielandt H.W.: Permutation groups through invariant relations and invariant functions. Lecture Notes. Ohio State University, 1969.
273. Wielandt H.W.: Finite permutation groups. Academic Press, N.Y., 1964.
274. Wigner E.: Group theory and its application to the quantum mechanics of atomic spectra. Academic, N.Y., 1959.
275. Wipke W.T., Dyott T.M.: Stereochemically unique naming algorithm. J. Am. Chem. Soc. 96, 1974, 4834-4842.
276. Yates F.: The design and analysis of factorial experiments. Bulletin 35. Imperial Bureau of Soil Science. Hafner (Macmillan), Harpenden, Herts, 1937.
277. Zaichenko V.A., Klin M.H., Faradžev I.A.: On certain questions related to the representation of permutation groups in a computer memory. In: Computations in algebra, number theory and combinatorics, Kiev, IK AN Ukr. SSR, 1980, 21-32 (Russian).
278. Zefirov N.S., Gordeeva E.V.: Computer-assisted synthesis. Russ. Chem. Rev. 56, 1987, 1002-1014.
279. Zefirov N.S., Gordeeva E.V., Tratch S.S: Problems of molecular design and computer. 11. The FLAMINGOES program for the non-empirical solution of structural problems of organic chemistry. The BASIC program oriented for microcomputers. J. Chem. Inf. Comput. Sci. 28, 1988, 188-193.
280. Zefirov N.S., Tratch S.S., Kalužnin L.A.: On a generalization of the wreath product of groups and its use for the description of structural formulas of chemical compounds. In: M.H. Klin, Faradžev (eds.): Investigations in algebraic theory of combinatorial objects. VNIISI, Moscow, 1985, pp. 175-186 (Russian).
281. Zefirov N.S., Tratch S.S., Chižov O.S.: Cage and polycyclic compounds molecular design based on the isomorphic substitution principle. Results of Science and Technics. Organic Chemistry. VINITI, Moscow, 1979, vol. 3 (Russian).
282. Zemlyachenko V.N., Korneenko N.M., Tyshkevich R.I.: The graph isomorphism problem. Zapiski Nauchn. Semin. LOMI 118, 1982, 83-158 (Russian).
283. Zieschang P.-H.: An Algebraic Approach to Association Schemes. Lect. Notes Math., 1628, Springer, 1996.
284. Zlatina L.A., Elyashberg M.E.: Generation of stereoisomers and their spatial models corresponding to the given molecular structure. MATCH 27, 1992, 191-207. MATCDY (40) 139-151 (1999)