کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
9512405 1632461 2005 10 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
On 2-edge-connected [a,b]-factors of graphs with Ore-type condition
موضوعات مرتبط
مهندسی و علوم پایه ریاضیات ریاضیات گسسته و ترکیبات
پیش نمایش صفحه اول مقاله
On 2-edge-connected [a,b]-factors of graphs with Ore-type condition
چکیده انگلیسی
Let a⩾2 and t⩾2 be two integers. Suppose that G is a 2-edge-connected graph of order |G|⩾2(t+1)((a-2)t+a)+t-1 with minimum degree at least a. Then G has a 2-edge-connected [a,at]-factor if every pair of non-adjacent vertices has degree sum at least 2|G|/(1+t). This lower bound is sharp. As a consequence, we have Ore-type conditions for the existence of a 2-edge-connected [a,b]-factor in graphs.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Discrete Mathematics - Volume 296, Issues 2–3, 6 July 2005, Pages 225-234
نویسندگان
,