کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
4657505 | 1343742 | 2006 | 18 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Tetravalent edge-transitive Cayley graphs with odd number of vertices
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
ریاضیات گسسته و ترکیبات
پیش نمایش صفحه اول مقاله

چکیده انگلیسی
A characterisation is given of edge-transitive Cayley graphs of valency 4 on odd number of vertices. The characterisation is then applied to solve several problems in the area of edge-transitive graphs: answering a question proposed by Xu [Automorphism groups and isomorphisms of Cayley graphs, Discrete Math. 182 (1998) 309–319] regarding normal Cayley graphs; providing a method for constructing edge-transitive graphs of valency 4 with arbitrarily large vertex-stabiliser; constructing and characterising a new family of half-transitive graphs. Also this study leads to a construction of the first family of arc-transitive graphs of valency 4 which are non-Cayley graphs and have a ‘nice’ isomorphic 2-factorisation.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Journal of Combinatorial Theory, Series B - Volume 96, Issue 1, January 2006, Pages 164-181
Journal: Journal of Combinatorial Theory, Series B - Volume 96, Issue 1, January 2006, Pages 164-181