Labeling techniques on Pn+1∗ graph

In the mathematical discipline of graph theory, a graph labeling is the assignment of labels, traditionally represented by integers, to the edges or vertices, or both, of a graph. It was first introduced by Rosa [5] in mid sixties. Numerous graph labeling techniques have been studied in over 1000 papers and is still getting garnished due to the arise of different application driven concepts. Here, we will introduce a graph Pn+1*. Thereafter we will focus on different labelings-graceful, felicitous, indexable & n+1-equitable, in view of its techniques on Pn+1*. Moreover, we will aim at finding relations between graceful labeling & n+1-equitable labeling, indexable labeling & felicitous labelling of Pn+1* under its labeling techniques.