RT - Journal Article
T1 - AUTOMORPHISM GROUPS OF SOME NON-TRANSITIVE GRAPHS
JF - IJMSI
YR - 2007
JO - IJMSI
VO - 2
IS - 1
UR - http://ijmsi.ir/article-1-58-en.html
SP - 47
EP - 54
K1 - Weighted graph
K1 - Euclidean graph
K1 - Automorphism group.
AB - 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.
LA eng
UL http://ijmsi.ir/article-1-58-en.html
M3 10.7508/ijmsi.2007.01.005
ER -