The labeling problem considered for this is called face-labeling of the maximal planar or triangular planar graphs in connection with the notion of the . Several triangular planar and maximal planar graphs such as the wheels, the fans etc. have been considered. The face-labeling of maximal...

A tree is said to be -magic if there exits a super magic labeling such that then the vertices of is partioned into three color classes , , so that the vertex labels in ∈ {1,2,3} are all consecutive labels. In this paper we have given -magic labeling of a class of trees with diameter four that...