EMIS ELibM Electronic Journals PUBLICATIONS DE L'INSTITUT MATHÉMATIQUE (BEOGRAD) (N.S.)
Vol. 34(48), pp. 233--237 (1983)

Previous Article

Next Article

Contents of this Issue

Other Issues

ELibM Journals

ELibM Home

EMIS Home

 		 

ON THE AUTOMORPHISM GROUP OF AN INFINITE GRAPH

Aleksandar Torgasev

Matematicki fakultet, Beograd, Yugoslavia

Abstract: In this paper, a specially defined automorphism group $\Gamma(G)$ of a connected countable simple infinite graph is considered. As the main result, we prove that $\Gamma(G)$ contains at most one non-trivial element. All infinite graphs with a non-trivial automorphism group are completely described. Finally, for graphs with odd, or with a small even number (2 or 4) of non-zero eignevalues, the corresponding automorphism groups are characterized.

Classification (MSC2000): 05C50

Full text of the article:

Electronic fulltext finalized on: 3 Nov 2001. This page was last modified: 16 Nov 2001.

© 2001 Mathematical Institute of the Serbian Academy of Science and Arts
© 2001 ELibM for the EMIS Electronic Edition