On the Construction of the Reflexive Vertex -Labeling of Any Graph with Pendant Vertex
Algorithm 2
The vertices’ and edges’ labels.
(1)
Given that the vertex weight by .
(2)
Assign the labels of vertices by and assign the labels of edges which are incident to by such that it meets with given vertex weight.
(3)
When on point (ii), the label of edges is more than , relabel the vertices with as well as relabel the edges which are incident to by such that it meets with given vertex weight .
