Edge vertex prime labeling of some graphs

Abstract

Let G = (V (G), E(G)) be a graph with p vertices and q edges. A bijective function f : V (G) E(G) → {1, 2, 3, ..., p + q} is said to be an edge vertex prime labeling, if for any edge xy ∈ E(G), it is satisfies that f (x), f (y) and f (xy) are pairwise relatively prime. In this paper, we investigate several families of edge vertex prime labeling for triangular and rectangular book, Butterfly graph, Drums graph D n , Jahangir graph J n,3 and J n,4 .

Edge vertex prime labeling of graphs

“…In [6], they also proved that K 2,n , for all n and K 3,n for n = {2, 3, ..., 29} are edge vertex prime labeling. We [8] proved that triangular and rectangular book, butterfly graph, Drums graph D n , Jahangir graph J n,3 and J n,4 are edge vertex prime labeling.…”

Edge Vertex Prime Labeling of Union of Graphs

“…An edge vertex prime graph can be [6] determined that for every and for . In [7], we proved that triangular and rectangular…”