TY - JOUR T1 - THE AUTOMORPHISM GROUP OF FINITE GRAPHS TT - JF - IJMSI JO - IJMSI VL - 2 IS - 2 UR - http://ijmsi.ir/article-1-22-en.html Y1 - 2007 SP - 29 EP - 33 KW - FINITE GRAPH KW - GRAPH AUTOMORPHISM KW - BIPARTITE GRAPH N2 - Let G = (V,E) be a simple graph with exactly n vertices and m edges. The aim of this paper is a new method for investigating nontriviality of the automorphism group of graphs. To do this, we prove that if |E| >=[(n - 1)2/2] then |Aut(G)|>1 and |Aut(G)| is even number. M3 10.7508/ijmsi.2007.02.004 ER -