Abstract:

       This paper relaxes the restriction conditions of a vertex of distance 2 and puts them on its spanning trees. We therefore presents a new labeling issue, and its general upper bound.

Key words: L(p,1)-vertex labeling, L(p,1T)-vertex labeling, spanning tree, maximum degree