Library

feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Electronic Resource
    Electronic Resource
    New York, NY : Wiley-Blackwell
    International Journal of Quantum Chemistry 26 (1984), S. 69-89 
    ISSN: 0020-7608
    Keywords: Computational Chemistry and Molecular Modeling ; Atomic, Molecular and Optical Physics
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Chemistry and Pharmacology
    Notes: Isomerization of octahedral complexes XY6, by a mechanism known as diagonal twist (in which two ligands in cis positions, one to another, exchange sites) is considered. Construction of the corresponding isomerization graph is outlined (reported before by Balaban) and the problem of determining its symmetry is considered. Alternative routes for deducing the order of the automorphism group are described. The group is confirmed to be S6 and representative symmetry permutations (one for each of the 11 classes of S6) are shown. Alternative pictorial representations of the 15-vertex graph are also shown.
    Additional Material: 12 Ill.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    New York, NY [u.a.] : Wiley-Blackwell
    Journal of Computational Chemistry 4 (1983), S. 267-275 
    ISSN: 0192-8651
    Keywords: Computational Chemistry and Molecular Modeling ; Biochemistry
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Chemistry and Pharmacology , Computer Science
    Notes: A procedure has been devised to determine the automorphism partition and the automorphism group for nondirected graphs. The general approach is to reveal the permutational symmetry by means of its systematic destruction. Symmetry decomposition pathways are created by numerically weighting specific series of vertices. Each pathway leads to a discrete ordered vector. Each pair of pathways that match reveals an element of the automorphism group. Results are presented for two molecular graphs. Further potential applications of this approach to problems of isomorphism, canonical labeling, and structural indexing are discussed.
    Additional Material: 4 Ill.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...