Search

A total k -labeling is a function f e from the edge set to first natural number k e and a function f v from the vertex set to non negative even number up to 2 k v , where k = max k e , 2 k v . A vertex irregular reflexive k -labeling of a simple, undirected, and finite graph G is total k -labeling, if for every two different vertices x and x ′ of G , w t x ≠ w t x ′ , where w t x = f v x + Σ x y ∈ E G f e x y . The minimum k for graph G which has a vertex irregular reflexive k -labeling is called the reflexive vertex strength of the graph G , denoted by rvs G . In this paper, we determined the exact value of the reflexive vertex strength of any graph with pendant vertex which is useful to analyse the reflexive vertex strength on sunlet graph, helm graph, subdivided star graph, and broom graph. [ABSTRACT FROM AUTHOR]