AU - A. Gholami,
TI - AUTOMORPHISM GROUPS OF SOME NON-TRANSITIVE GRAPHS
PT - JOURNAL ARTICLE
TA - IJMSI
JN - IJMSI
VO - 2
VI - 1
IP - 1
4099 - http://ijmsi.ir/article-1-58-en.html
4100 - http://ijmsi.ir/article-1-58-en.pdf
SO - IJMSI 1
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.
CP - IRAN
IN -
LG - eng
PB - IJMSI
PG - 47
PT - Research paper
YR - 2007