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

Authors


Abstract

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.

Ancillary