Iranian Journal of Mathematical Sciences and Informatics
مجله علوم ریاضی و انفورماتیک
IJMSI
Basic Sciences
http://ijmsi.ir
1
admin
1735-4463
2008-9473
8
10.61186/ijmsi
14
8888
13
en
jalali
1386
8
1
gregorian
2007
11
1
2
2
online
1
fulltext
en
THE AUTOMORPHISM GROUP OF FINITE GRAPHS
عمومى
General
پژوهشي
Research paper
<p>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.</p>
FINITE GRAPH, GRAPH AUTOMORPHISM, BIPARTITE GRAPH
29
33
http://ijmsi.ir/browse.php?a_code=A-10-1-22&slc_lang=en&sid=1
G. H. FATH TABAR
10031947532846002054
10031947532846002054
Yes