Volume 2, Issue 2 (November 2007)                   IJMSI 2007, 2(2): 29-33 | Back to browse issues page

‎ 10.7508/ijmsi.2007.02.004

XML Print

THE AUTOMORPHISM GROUP OF FINITE GRAPHS
G. H. FATH TABAR
Abstract:  

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.

Keywords: FINITE GRAPH, GRAPH AUTOMORPHISM, BIPARTITE GRAPH
Full-Text [PDF 86 kb]      
Type of Study: Research paper | Subject: General
Rights and permissions
Creative Commons License This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.