کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
4650763 | 1632441 | 2008 | 25 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
(r,r+1)(r,r+1)-factorizations of (d,d+1)(d,d+1)-graphs
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
ریاضیات گسسته و ترکیبات
پیش نمایش صفحه اول مقاله

چکیده انگلیسی
A (d,d+1)(d,d+1)-graph is a graph whose vertices all have degrees in the set {d,d+1}{d,d+1}. Such a graph is semiregular . An (r,r+1)(r,r+1)-factorization of a graph G is a decomposition of G into (r,r+1)(r,r+1)-factors. For d-regular simple graphs G we say for which x and r G must have an (r,r+1)(r,r+1)-factorization with exactly x (r,r+1)(r,r+1)-factors. We give similar results for (d,d+1)(d,d+1)-simple graphs and for (d,d+1)(d,d+1)-pseudographs. We also show that if d≥2r2+3r-1d≥2r2+3r-1, then any (d,d+1)(d,d+1)-multigraph (without loops) has an (r,r+1)(r,r+1)-factorization, and we give some information as to the number of (r,r+1)(r,r+1)-factors which can be found in an (r,r+1)(r,r+1)-factorization.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Discrete Mathematics - Volume 308, Issues 5–6, 28 March 2008, Pages 645–669
Journal: Discrete Mathematics - Volume 308, Issues 5–6, 28 March 2008, Pages 645–669
نویسندگان
A.J.W. Hilton,