Labeled Packing of Non Star Tree into its Fifth Power and Sixth Power
Sahili, Amine El · Kheddouci, Hamamache · Mortada, Maidoun
الأصل · EN
In this paper we prove that we can find a labeled packing of a non star tree T into T⁶ with mₜ+-mₜ/5 labels, where n is the number of vertices of T and mₜ is the maximum number of leaves that can be removed from T in such a way that the obtained graph is a non star tree. Also, we prove that we can find a labeled packing of a non star tree T into T⁵ with mₜ+1 labels and a labeled packing of a path Pₙ, n≥ 4, into Pₙ⁴ with n/4 labels.
الترجمة العربية
لا توجد ترجمة عربية لهذا البحث بعد. كن أوّل من يطلبها: تستغرق ثوانيَ معدودة، وتُحفظ النتيجة لكل قارئ قادم.