PERMUTATION LABELING OF JOINS OF KITE GRAPH

Let G= (V, E) be a graph with p vertices and q edges. A graph G={V, E} with p vertices and q edges is said to be a Permutation labelling graph if there exists a bijection function f from set of all vertices ( ) V G to {1, 2,3... } p such that the induced edge labelling function