Find in Library

For a graph we define -labeling such that the edges of are labeled with integers and the vertices of are labeled with even integers , where . The labeling is called a vertex irregular reflexive -labeling if distinct vertices have distinct weights, where the vertex weight is defined as the sum of the label of that vertex and the labels of all edges incident this vertex. The smallest for which such labeling exists is called the reflexive vertex strength of . In this paper, we give exact values of reflexive vertex strength for prisms, wheels, fan graphs and baskets.