It is shown that the molecular symmetry groups can be obtained as the automorphism groups of edge-weighted Euclidean graphs. Graph theory provides an elegant and natural representation of molecular symmetry. The resulting group expressed in terms of permutations is isomorphic to the permutation-inve
Symmetries of knotted hypothetical molecular graphs
โ Scribed by Erica Flapan
- Publisher
- Elsevier Science
- Year
- 1988
- Tongue
- English
- Weight
- 708 KB
- Volume
- 19
- Category
- Article
- ISSN
- 0166-218X
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Certain colored graphs are defined in terms of permutations in S, and the edge-chromatic automorphism groups of these graphs are studied. In fact, these groups are characterized in terms of the associated permutations. These groups are related to the groups of symmetries of certain drawings of cycle
## Abstract A perfect colouring ฮฆ of a simple undirected connected graph __G__ is an edge colouring such that each vertex is incident with exactly one edge of each colour. This paper concerns the problem of representing groups by graphs with perfect colourings. We define groups of graph automorphis