THE AUTOMORPHISM GROUP OF FINITE GRAPHS

被引:1
|
作者
Fath-Tabar, G. H. [1 ]
机构
[1] Univ Kashan, Fac Sci, Dept Math, Kashan 8731751167, Iran
关键词
Finite graph; graph automorphism; bipartite graph;
D O I
10.7508/ijmsi.2007.02.004
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
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 non-triviality of the automorphism group of graphs. To do this, we prove that if |E| >= left perpendicular (n - 1)(2)/2 right perpendicular then |Aut(G)| > 1 and |Aut( G)| is even number.
引用
收藏
页码:29 / 33
页数:5
相关论文
共 50 条