کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
6423587 | 1342425 | 2011 | 8 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Spanning trees with at most k leaves in K1,4-free graphs
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
ریاضیات گسسته و ترکیبات
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
We obtain a sufficient condition for K1,4-free graphs to have spanning trees with at most k leaves, as a generalization of the condition of Kyaw [A. Kyaw, Spanning trees with at most 3 leaves in K1,4-free graphs, Discrete Math. 309 (2009) 6146-6148] for K1,4-free graphs to have spanning trees with at most 3 leaves.
⺠We obtain a result for K1,4-free graphs to have spanning trees with at most k leaves. ⺠This result is a generalization of the condition of Kyaw for K1,4-free graphs to have spanning trees with at most 3 leaves. ⺠To prove our result, we use the notion of a t-ended system of vertices, paths and cycles in a graph, which was introduced by Win.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Discrete Mathematics - Volume 311, Issue 20, 28 October 2011, Pages 2135-2142
Journal: Discrete Mathematics - Volume 311, Issue 20, 28 October 2011, Pages 2135-2142
نویسندگان
Aung Kyaw,