کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
420590 | 683957 | 2008 | 7 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Characterizations of maximum fractional (g,f)(g,f)-factors of graphs
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
نظریه محاسباتی و ریاضیات
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: Characterizations of maximum fractional (g,f)(g,f)-factors of graphs Characterizations of maximum fractional (g,f)(g,f)-factors of graphs](/preview/png/420590.png)
چکیده انگلیسی
In this paper a characterization of maximum fractional (g,f)(g,f)-factors of a graph is presented. The properties of the maximum fractional (g,f)(g,f)-factors and fractional (g,f)(g,f)-factors with the minimum of edges are also given, generalizing the results given in [William Y.C. Chen, Maximum (g,fg,f)-factors of a general graph, Discrete Math. 91 (1991) 1–7] and [Edward R. Scheinerman, Daniel H. Ullman, Fractional Graph Theory, John Wiley and Sonc, Inc., New York, 1997]. Furthermore, some new results on fractional factors are obtained which may be used in the design of networks. A polynomial time algorithm can be obtained for actually finding such maximum fractional (g,f)(g,f)-factors in a graph from the proof.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Discrete Applied Mathematics - Volume 156, Issue 12, 28 June 2008, Pages 2293–2299
Journal: Discrete Applied Mathematics - Volume 156, Issue 12, 28 June 2008, Pages 2293–2299
نویسندگان
Guizhen Liu, Lanju Zhang,