L(h, k) Labeling in graph came into existence as a solution to frequency assignment problem. To reduce interference a frequency in the form of non negative integers is assigned to each radio or TV transmitters located at various places. After L(h, k) labeling, L(h, k, j) labeling is introduced to reduce noise in the communication network. We investigated the graph obtained by Cartesian Product between Complete Bipartite Graph with Path and Cycle, i. e., K_(m,n) × P_r and K_(m,n) × C_r by applying L(3, 2, 1) Labeling. The L(3, 2, 1) Labeling of a graph G is the difference between the highest and the lowest labels used in L(3, 2, 1) and is denoted by λ_(3,2,1)(G) In this paper we have designed three suitable algorithms to label the graphs K_(m,n) × P_r and K_(m.n) × C_r. We have also analyzed the time complexity of each algorithm with illustration.
展开▼
