کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
6872510 | 681651 | 2014 | 7 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
On the excessive [m]-index of a tree
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
نظریه محاسباتی و ریاضیات
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
The excessive [m]-index of a graph G, denoted by Ï[m]â²(G), is the minimum number of matchings of size m needed to cover the edge-set of G. We set Ï[m]â²(G)=â if such a cover does not exist and we call a graph G[m]-coverable if its excessive [m]-index is finite. Obviously Ï[1]â²(G)=|E(G)| and it is easy to prove for a [2]-coverable graph G that Ï[2]â²(G)=max{Ïâ²(G),â|E(G)|/2â} holds, where Ïâ²(G) denotes the chromatic index of G. The case m=3 is completely solved in Cariolaro and Fu (2009)Â [4]. In this paper we prove a general formula for computing the excessive [4]-index of a tree and we conjecture a possible generalization for any value of m. Furthermore, we prove that such a formula does not work for the excessive [4]-index of an arbitrary graph.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Discrete Applied Mathematics - Volume 162, 10 January 2014, Pages 264-270
Journal: Discrete Applied Mathematics - Volume 162, 10 January 2014, Pages 264-270
نویسندگان
G. Mazzuoccolo,