کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
6423352 | 1342326 | 2015 | 9 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Ï-symmetric Hamilton cycle decompositions of graphs
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
ریاضیات گسسته و ترکیبات
پیش نمایش صفحه اول مقاله

چکیده انگلیسی
The existence of symmetric Hamilton cycle decompositions for complete graphs and cocktail party graphs has been defined and explored in recent work by Akiyama et al., Brualdi and Schroeder, and others. In these works, the notion of symmetry in cocktail party graphs K2mâF was integrally tied to the missing 1-factor. In this paper, we generalize the notion of symmetric decompositions in two ways. First, we require only that F is symmetric and show that if F is not the invariant 1-factor under the symmetry action, then K2mâF has a symmetric Hamilton cycle decomposition for every mâ¥2. Second, we consider other actions as symmetry, apply such definitions to appropriate complete graphs and complete multipartite graphs, and classify the existence of Hamilton cycle decompositions with such symmetry.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Discrete Mathematics - Volume 338, Issue 9, 6 September 2015, Pages 1586-1594
Journal: Discrete Mathematics - Volume 338, Issue 9, 6 September 2015, Pages 1586-1594
نویسندگان
Michael W. Schroeder,