English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

In this paper we prove that we can find a labeled packing of a non star tree$T$ into $T^6$ with $m_T+\lceil\frac{n-m_T}{5}\rceil$ labels, where $n$ is thenumber of vertices of $T$ and $m_T$ is the maximum number of leaves that can beremoved 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\geq 4$,into $P_n^4$ with $\lceil \frac{n}{4}\rceil$ labels.

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