en عمومى General پژوهشي Research paper <p>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.</p> Weighted graph, Euclidean graph, Automorphism group. 47 54 http://ijmsi.ir/browse.php?a_code=A-10-1-56&slc_lang=en&sid=1 A. Gholami 10031947532846002045 10031947532846002045 Yes