## 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
Symmetry groups of chemical graphs
β Scribed by K. Balasubramanian
- Publisher
- John Wiley and Sons
- Year
- 1982
- Tongue
- English
- Weight
- 390 KB
- Volume
- 21
- Category
- Article
- ISSN
- 0020-7608
No coin nor oath required. For personal study only.
β¦ Synopsis
Abstract
The symmetry groups of all trees are shown to be expressible as generalized wreath products by a tree pruning algorithm. The symmetry groups of certain cyclic graphs which can be expresssed as generalized compositions are also shown to be generalized wreath products. The symmetry groups of complete multipartite graphs can be obtained in a similar manner. Character tables of symmetry groups of certain chemical graphs are also obtained.
π SIMILAR VOLUMES
## Abstract Using a canonical numbering of vertices for the graph corresponding to a particular rearrangement of tetragonalβpyramidal complexes, all 120 permutations defining the symmetry for the rearrangement are derived. An examination of the permutations points to the symmetric group __S__~5~, w
The concurrence of the group of symmetry of the periodic system of elements with the group of dynamical symmetry of a hydrogenlike atom is employed in the theoretical investigation of atoms. The character of the degeneracy of the eigenvalues of a hydrogenlike atom Hamiltonian, without changing its e