Abstract

With respect to a simple graph G, a vertex labeling ϕ: V(G) > {1,2,...,k) is known as k-labeling. The weight corresponding to an edge xy in G, expressed as wϕ (xy), represents the labels sum of end vertices x and y, given by wϕ (xy) = ϕ(x) + ϕ(y) A vertex k-labeling is expressed as an edge irregular k-labeling with respect to graph G provided that for every two distinct edges e and f, there exists wϕ(e) ≠ wϕ(f) Here, the minimum k where the graph G possesses an edge irregular k-labeling is known as the edge irregularity strength with respect to G, expressed as (G). Here, we examine the edge irregularity strength’s exact value of corona product with respect to two paths Pn and Pm , in which n ≥ 2 and m = 3, 4, 5.

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