✦ LIBER ✦

Unique description of chemical structures on hierarchically ordered extended connectivities (HOC procedures). II. Mathematical proofs for the HOC algorithm

✍ Scribed by Ovanes Mekenyan; Danail Bonchev; Alexandru T. Balaban

Publisher: John Wiley and Sons
Year: 1985
Tongue: English
Weight: 945 KB
Volume: 6
Category: Article
ISSN: 0192-8651
DOI: 10.1002/jcc.540060607

No coin nor oath required. For personal study only.

✦ Synopsis

The basic notions and definitions, necessary for the better understanding of Part I of this series, are presented. The mathematical proof is given for sufficiency of the various HOC procedures for vertex canonical numbering and graph orbit finding.

📜 SIMILAR VOLUMES

Unique description of chemical structure

Unique description of chemical structures based on hierarchically ordered extended connectivities (HOC procedures). VIII. General principles for computer implementation

✍ Nikolai Ralev; Stoyan Karabunarliev; Ovanes Mekenyan; Danail Bonchev; Alexandru 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 327 KB

The computer implementation of the HOC procedures presented in Parts I, I1 and I11 of this series is based on the module principle. It contains a main program and seventeen subroutines in Fortran IV. The system is able to provide unique atom numbering and code for all kinds of chemical compounds in

Unique description of chemical structure

Unique description of chemical structures based on hierarchically ordered extended connectivities (HOC procedures). III. Topological, chemical, and stereochemical coding of molecular structure

✍ Alexandru T. Balaban; Ovanes Mekenyan; Danail Bonchev 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 797 KB

A topological code is devised on the basis of the unique topological representation of the molecule described in the preceding two parts of this series.' By adding to the topological code additional chemical information on atoms and/or bonds, as well as stereochemical information, a chemical and res

Unique description of chemical structure

Unique description of chemical structures based on hierarchically ordered extended connectivities (HOC procedures). V. New topological indices, ordering of graphs, and recognition of graph similarity

✍ Ovanes Mekenyan; Danail Bonchev; Alexandru T. Balaban 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 774 KB

The vertex numbering obtained by application of the HOC algorithm can be converted into two sequences of numbers: If each vertex starting with vertex 1 is only counted once, the sums of numberings of adjacent vertices form sequence S, ( i = 1-N), while the sums of S, values form sequence MI ( i = 1-