Let H(V,E) be a graph. Vertex edge neighborhood prime labeling is a function g:V(H)∪E(H)→{1,2,...,|V(H)∪E(H)|} with one to one correspondence and if (i) for α∈V(H) with deg(α)=1, gcd(g(γ),g(αγ):γ∈N_V (α))=1. (ii) for α∈V(H) with deg(α)≥2, gcd(g(γ):γ∈N_V (α))=1. gcd(g(l):l∈N_E (α))=1. A graph admits such labeling is called a vertex edge neighborhood prime graph. In the present work we deal with general graphs of union of some families of graphs are vertex edge neighborhood prime graph.
Volume 12 | Issue 7
Pages: 611-628
DOI: 10.5373/JARDCS/V12I7/20202044