@inproceedings{Ashrafia2005SymmetryPO,
title={Symmetry Properties of Some Chemical Graphs *},
author={Ali Reza Ashrafia and Masood Hamadanianb},
year={2005}
}

Ali Reza Ashrafia, Masood Hamadanianb

Published 2005

Let G be a weighted graph with the adjacency matrix A = aij . A Euclidean graph associated with a molecule is defined by a weighted graph with the adjacency matrix D = dij , where for i j, dij is the Euclidean distance between the nuclei i and j. In this matrix, dii can be taken to be zero if all the nuclei are equivalent. Otherwise, one may introduce different weights for different nuclei. Balasubramanian computed the Euclidean graphs and automorphism groups for benzene, eclipsed and staggered… CONTINUE READING