Abstract

We define a total k-labeling of a graph G as a combination of an edge labeling and a vertex labeling such that if and if where The total k-labeling is called an edge irregular reflexive k-labeling of G if every two different edges has distinct edge weights, where the edge weight is defined as the summation of the edge label itself and its two vertex labels. Thus, the smallest value of k for which the graph G has the edge irregular reflexive k-labeling is called the reflexive edge strength of G. In this paper, we study the edge irregular reflexive labeling of corona product of two paths and corona product of a path with isolated vertices. We determine the reflexive edge strength for these graphs.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call