1Combinatorial Mathematics Research Division Faculty of Mathematics and Natural Sciences Institut Teknologi Bandung, Jalan Ganesa 10 Bandung 40132, Indonesia
Let be a path on vertices. A simple graph admits a -covering if every edge in belongs to a subgraph of that is isomorphic to . is called -magic if there is a total labeling such that for each subgraph of that is isomorphic to , is constant. When , we say that is -supermagic.
In this paper, we study some -supermagic trees. We give some sufficient or necessary conditions for a tree to be -supermagic. We also consider the -supermagicness of special types of trees, namely shrubs and banana trees.
Keywords: H-covering, H-supermagic, Total labeling