@ARTICLE{A. Gholami,
author = {A. Gholami, and },
title = {AUTOMORPHISM GROUPS OF SOME NON-TRANSITIVE GRAPHS},
volume = {2},
number = {1},
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. },
URL = {http://ijmsi.ir/article-1-58-en.html},
eprint = {http://ijmsi.ir/article-1-58-en.pdf},
journal = {Iranian Journal of Mathematical Sciences and Informatics},
doi = {10.7508/ijmsi.2007.01.005},
year = {2007}
}