TY - JOUR
JF - IJMSI
JO - IJMSI
VL - 2
IS - 1
PY - 2007
Y1 - 2007/5/01
TI - AUTOMORPHISM GROUPS OF SOME NON-TRANSITIVE GRAPHS
TT -
N2 - 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.
SP - 47
EP - 54
AU - A. Gholami,
AD -
KW - Weighted graph
KW - Euclidean graph
KW - Automorphism group.
UR - http://ijmsi.ir/article-1-58-en.html
DO - 10.7508/ijmsi.2007.01.005
ER -