کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
4653619 | 1632783 | 2014 | 13 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Semisymmetric graphs of order 2p3
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
ریاضیات گسسته و ترکیبات
پیش نمایش صفحه اول مقاله

چکیده انگلیسی
A simple undirected graph is said to be semisymmetric if it is regular and edge-transitive but not vertex-transitive. Every semisymmetric graph is a bipartite graph with two parts of equal size. It was proved in Folkman (1967)Â [14] that there exist no semisymmetric graphs of order 2p and 2p2, where p is a prime. The classification of semisymmetric graphs of order 2pq was given in Du and Xu (2000)Â [12], for any distinct primes p and q. Our long term goal is to determine all the semisymmetric graphs of order 2p3, for any prime p. All these graphs Î are divided into two subclasses: (I) Aut(Î) acts unfaithfully on at least one bipart; and (II) Aut(Î) acts faithfully on both biparts. This paper gives a group theoretical characterization for Subclass (I) and based on this characterization, we shall give a complete classification for this subclass in our further research.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: European Journal of Combinatorics - Volume 36, February 2014, Pages 393-405
Journal: European Journal of Combinatorics - Volume 36, February 2014, Pages 393-405
نویسندگان
Li Wang, Shaofei Du,