Related Experiment Video
Updated: Oct 3, 2026

Conscious and Non-conscious Representations of Emotional Faces in Asperger's Syndrome
Published on: July 31, 2016
The study on automorphism group of ESESOC
1Changchun Institute of Applied Chemistry, Academia Sinica, People's Republic of China.
Abstract:
It is necessary to generate the automorphism group of a chemical graph in computer-aided structure elucidation. In this paper, an algorithm was developed by the all-paths topological symmetry algorithm to build the automorphism group of a chemical graph. A comparison of several topological symmetry algorithms reveals that the all-paths algorithm (APA) could yield the correct class of a chemical graph. It lays a foundation for the ESESOC system in computer-aided structure elucidation.
Related Concept Videos
Woodward–Hoffmann Selection Rules and Microscopic Reversibility
Fundamental Theorem of Algebra
Stereoisomerism of Cyclic Compounds
Eccentric Axial Loading in a Plane of Symmetry
Symmetry
SFG Algebra
Each node in an SFG corresponds to a variable, and the interactions between nodes are represented by branches with associated gains. When multiple branches lead into a node, the value at that node is the sum of the...
