Paper Information

Title: 

TETRAVALENT HALF-TRANSITIVE GRAPHS OF ORDER 2P2

Type: PAPER
Author(s): GHASEMI MOHSEN*
 
 *DEPARTMENT OF MATHEMATICS, URMIA UNIVERSITY, URMIA 57135, IRAN
 
Name of Seminar: SEMINAR ON ALGEBRA (SALG20)
Type of Seminar:  CONFERENCE
Sponsor:  TARBIAT MOALLEM UNIVERSITY, FACULTY OF MATHEMATICAL SCIENCES AND COMPUTER
Date:  2009Volume 20
 
 
Abstract: 

graph is half-transitive if its automorphism group acts transitively on its vertex set and edge set, but not on its arc set. Let p be a prime. Chao [On the classification of symmetric graphs with a prime number of vertices, Trans. Amer. Math. Soc. 158 (1971) 247-256] proved that there are no half-transitive graphs on p vertices. By Cheng and Oxley [On weakly symmetric graphs of order twice a prime, J. Combin. Theory B 42 (1987) 196-211], also there are no half-transitive graphs of order 2p. In this paper an extension of the above results in the case of tetravalent graphs is given. It is proved that there are no tetravalent half-transitive graphs of order 2p2.

 
Keyword(s): HALF-TRANSITIVE GRAPHS, CAYLEY GRAPHS, SOLVABLE GROUPS
 
Yearly Visit 20   pdf-file tarjomyar
 
Latest on Blog
Enter SID Blog