Contents

-

Ph-Supermagic Labelings of Some Trees

T. K. Maryati1, E. T. Baskoro1, A. N. M. Salman1
1Combinatorial Mathematics Research Division Faculty of Mathematics and Natural Sciences Institut Teknologi Bandung, Jalan Ganesa 10 Bandung 40132, Indonesia

Abstract

Let Ph be a path on h vertices. A simple graph G=(V,E) admits a Ph-covering if every edge in E belongs to a subgraph of G that is isomorphic to Ph. G is called Ph-magic if there is a total labeling f:VE{1,2,,|V|+|E|} such that for each subgraph H=(V,E) of G that is isomorphic to Ph, vVf(v)+eEf(e) is constant. When f(V)={1,2,,|V|}, we say that G is Ph-supermagic.

In this paper, we study some Ph-supermagic trees. We give some sufficient or necessary conditions for a tree to be Ph-supermagic. We also consider the Ph-supermagicness of special types of trees, namely shrubs and banana trees.

Keywords: H-covering, H-supermagic, Total labeling