AUTOMORPHISM GROUPS OF SOME NON-TRANSITIVE GRAPHS
Author(s):
Abstract:
An Euclidean graph associated with a molecule is defined by a weighted graph with adjacency matrix M = [dij], where for ij, dij is the Euclidean distance between the nuclei i and j. In this matrix dii can be taken as zero if all the nuclei are equivalent. Otherwise, one may introduce different weights for distinct nuclei. Balaban introduced some monster graphs and then Randic computed complexity indices of them (1973, 2001). In this paper, with a simple method, we calculate the automorphism group of some weighted graphs.
Language:
English
Published:
Iranian Journal of Mathematical Sciences and Informatics, Volume:2 Issue: 1, May 2007
Pages:
47 to 54
https://www.magiran.com/p622646
مقالات دیگری از این نویسنده (گان)
-
Increasing the efficiency of the key generation algorithm for NTRU with the help of the norm field
Reza Alimoradi *, Mohammadhossein Noorallahzadeh,
, -
On n-A-con-cos Groups and Determination of some 3-A-con-cos Groups
, Fatemeh Mahmudi
Mathematics Interdisciplinary Research, Winter 2021