کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
5777522 | 1632920 | 2017 | 38 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Vertex-imprimitive symmetric graphs with exactly one edge between any two distinct blocks
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
ریاضیات گسسته و ترکیبات
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: Vertex-imprimitive symmetric graphs with exactly one edge between any two distinct blocks Vertex-imprimitive symmetric graphs with exactly one edge between any two distinct blocks](/preview/png/5777522.png)
چکیده انگلیسی
A graph Î is called G-symmetric if it admits G as a group of automorphisms acting transitively on the set of ordered pairs of adjacent vertices. We give a classification of G-symmetric graphs Î with V(Î) admitting a nontrivial G-invariant partition B such that there is exactly one edge of Î between any two distinct blocks of B. This is achieved by giving a classification of (G,2)-point-transitive and G-block-transitive designs D together with G-orbits Ω on the flag set of D such that GÏ,L is transitive on Lâ{Ï} and Lâ©N={Ï} for distinct (Ï,L),(Ï,N)âΩ, where GÏ,L is the setwise stabilizer of L in the stabilizer GÏ of Ï in G. Along the way we determine all imprimitive blocks of GÏ on Vâ{Ï} for every 2-transitive group G on a set V, where ÏâV.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Journal of Combinatorial Theory, Series A - Volume 152, November 2017, Pages 303-340
Journal: Journal of Combinatorial Theory, Series A - Volume 152, November 2017, Pages 303-340
نویسندگان
Teng Fang, Xin Gui Fang, Binzhou Xia, Sanming Zhou,