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 vertice G( ) to {1, 2,3... }p such that the induced edge labelling function h E G N : ( ) → is defined as ( ) ( ) 1 2 1 ( 2 ) , f x h x x f x P = or ( ) 2 f x( 1 ) f x P according as f x f x ( 1 2 ) ( ) or f x f x ( 2 1 ) ( ) where P is the permutation of objects( representing the labels assigned to vertices). We in this paper have identified (m,n) Kite graph and attached an edge to form a join to the kite graph and proved that the joins of (m,n) kite graphs is permutation labelling graph and also have obtained some important results connecting the joins of a (m,n) kite graph