Labeled Packing of Non Star Tree into its Fifth Power and Sixth Power

Publication date 18 February 2013

Abstract: In this paper we prove that we can find a labeled packing of a non star tree

T

into

T^{6}

with

m_{T} + l c e i l f r a c n - m_{T} 5 c e i l

labels, where

n

is the number of vertices of

T

and

m_{T}

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^{5}

with

m_{T} + 1

labels and a labeled packing of a path

P_{n}

,

n g e q 4

, into

P_{n}^{4}

with

l c e i l f r a c n 4 c e i l

labels.

This page was built for publication: Labeled Packing of Non Star Tree into its Fifth Power and Sixth Power