کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
5776820 | 1413642 | 2017 | 7 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Spanning trees with leaf distance at least d
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
ریاضیات گسسته و ترکیبات
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: Spanning trees with leaf distance at least d Spanning trees with leaf distance at least d](/preview/png/5776820.png)
چکیده انگلیسی
The leaf distance of a tree is the maximum d such that the distance between any pair of leaves in the tree is at least d. Kaneko provided sufficient conditions to force the existence of a spanning tree with leaf distance at least d=3 and conjectured that similar conditions suffice for larger d. The case when d=4 was later proved by Kaneko, Kano, and Suzuki. In this paper, we show that when dâ¥4, a stronger form of this conjecture holds for graphs with independence number at most five. As an immediate corollary, we obtain that when dâ¥nâ3, this stronger version holds for all n-vertex graphs, consequently proving Kaneko's conjecture for dâ¥nâ3.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Discrete Mathematics - Volume 340, Issue 6, June 2017, Pages 1412-1418
Journal: Discrete Mathematics - Volume 340, Issue 6, June 2017, Pages 1412-1418
نویسندگان
C. Erbes, T. Molla, S. Mousley, M. Santana,