In this paper we have considered only simple, finite and connected graphs. In telecommunication systems, the most challenging
problem is to assign frequencies to different radio channels such that there is no interference between any two transistors and also
we have to minimize the usage of frequencies [5]. This problem can be modified as an graph theoretic problem where the radio
transmitters represents the vertices and adjacent transmitters are connected by an edge [2].
The problem of assigning frequencies to the radio transmitters is called as frequency assignment problem which was introduced by
William Hale [8]. In graph theory, the assignment of integers to vertices, edges or to both based on some condition is known as
graph labeling [4]. Gary Chartrand et al.
