Canonized molecular graphs

V. Kvasnicka, J. Pospichal, Canonical Indexing and Constructive Enumeration of Molecular Graphs, J.Chem.Inf.Comput.Sci., 30 (1990) 99-105. 

Local vertex invariants are used to calculate several molecular - topological indices by applying different operators such as addition of LOVIs, addition of squares of LOVIs, addition of reciprocal geometric means for any pair of adjacent vertices. Moreover, they can be used to obtain - canonical numbering of molecular graphs and compare molecules in order to study - molecular branching and centricity. 

Faulon, J.-L. (1998). Isomorphism, Automorphism Partitioning, and Canonical Labeling Can Be Solved in Polynomial-Time for Molecular Graphs. J.Chem.lnf.Comput.Scl, 38,432-444. 

The elements of the decimal adjacency vector are integers that were used for canonical numbering of molecular graphs [Randic, 1974]. 

Two-dimensional representations alternative to the molecular graph are the linear notation systems, for example, Wiswesser Line Notation system (WLN) [Smith and Baker, 1975], SMILES [Weininger, 1988, 1990, 2003 Weininger, Weininger et al., 1989 Convard, Dubost et al., 1994 Hinze and Welz, 1996], and SMARTS (SMART - Daylight Chemical Information Systems, 2004). CAST (CAnonical representation of STereochemistry) is a method that gives a linear notation that canonically represents stereochemistry around a specific site in a molecule [Satoh, Koshino et al, 2000, 2001, 2002],... 

Faulon, J.-L. (1998) Isomorphism, automorphism partitioning, and canonical labeling can be solved in polynomial-time for molecular graphs. J. Chem. Inf. Comput. Sci., 38, 432-444. 

A precondition for an efficient manipulation of BE-matrices in the computer is a canonical indexing of the atoms in a molecule. In order to generate a unique numbering we use the connectivity matrix of the molecular graph and the labels already assigned to its vertices, i.e. the chemical symbols. 

Partitioning, and Canonical Labeling Can Be Solved in Polynomial-Time for Molecular Graphs. 

Canonization of molecular structures. Often two or more seemingly different molecular graphs represent one and the same chemical compound. In particular, the atoms in a molecule can be numbered in various ways, which may lead to problems in compound identification. To avoid such problems, structural formulas have to be generated in a canonized data structure, so that two libraries are easily compeued to detect overlaps. 

Line (1) mns through the whole library of molecular graphs M,. In line (2) the size of substructures is limited by setting a lower and upper Umit for the number of edges. In line (3) S is canonically numbered, and in line (4) the count of S in M, is incremented. If a substructure is encountered for the first time, it is inserted into Map and associated with a vector of zeroes and size of . At the end, Map[S][i] contains the count of S in Mj. 

V. Kvasnicka and). Pospfchal. Canonical indexing and constructive enumeration of molecular graphs./. Chem. Inf Comput. Sci., 30 99-105,1990. 

The problem of canonical coding, graph isomorphism, and graph automorphism has both mathematical and chemical significance. The mathematical formulation of the problem is briefly set out below, and some cormections with the chemical counterpart are presented. In the subsequent sections, the main algorithms used in chemistry for canonical coding of molecular graphs and constitutional symmetry perception are presented and compared. 

In a series of papers Uchino used the matrix multiplication method for obtaining the canonical code and automorphisms of a molecular graph. He considered adjacency, distance, and open walks matrices in a series of efficient algorithms which offer the automorphism partition of graphs. 

---