# Exact Algorithm for L(2, 1) Labeling of Cartesian Product Between Complete Bipartite Graph and Path

## Abstract

Graph labeling problemput nonnegative integers to the vertex with some restrictions. *L*(*h*, *k*) labeling is one kind of graph labeling where adjacent nodes get the value difference by at least *h* and the nodes which are at 2 distance apart get value differ by at least *k*, which has major application in radio frequency assignment, where assignment of frequency to each node of radio station in such a way that adjacent station get frequency which does not create any interference. Robert in 1988 gives the idea of frequency assignment problem with the restriction “close” and “very close”, where “close” node received frequency that is different and “very close” node received frequency is two or more apart, which gives the direction to introduce *L*(2, 1) labeling. *L*(2, 1) labeling is a special case of *L*(*h*, *k*) labeling where the value of *h* is 2 and value of *k* is 1. In *L*(2, 1) labeling, the difference of label is at least 2 for the vertices which are at distance one apart and label difference is at least 1 for the vertices which are at distance two apart. The difference between minimum and maximum label of *L*(2, 1) labeling of the graph \(G=(V,E)\) is denoted by \(\lambda _{2,1}(G)\). Here, we propose a polynomial time algorithm to label the graph obtained by the Cartesian product between complete bipartite graph and path. We design the algorithm in such a way that gives exact *L*(2, 1) labeling of the graph \(G=(K_{m,n}\times P_r)\) for the bound of \(m,n>5\) and which is \(\lambda _{2,1}(G)= m+n\). Our proposed algorithm successfully follow the conjecture of Griggs and Yeh. Finally, we have shown that *L*(2, 1) labeling of the above graph can be solved in polynomial time for some bound.

## Keywords

Cartesian product \(L(h, k)\) labeling \(L(2, 1)\) labeling Complete bipartite graph Path## Notes

### Acknowledgements

The work is supported by the Department of Science and Technology, New Delhi, India, Ref. No. SB/S4/MS: 894/14.

## References

- 1.Griggs, J., Yeh, R.K.: Labeling graphs with a condition at distance two. SIAM J. Discret. Math.
**5**, 586–595 (1992)CrossRefGoogle Scholar - 2.Gonalves, D.: On the L(d, 1)-labellinng of graphs. Discret. Math.
**308**, 1405–1414 (2008)CrossRefGoogle Scholar - 3.Chang, G.J., Kuo, D.: The L(2, 1)-labeling on graphs. SIAM J. Discrete Math.
**9**, 309–316 (1996)MathSciNetCrossRefGoogle Scholar - 4.Hasunuma, T., Ishii, T., Ono, H., Uno, Y.: A linear time algorithm for L(2, 1)-labeling of trees. Lect. Notes Comput. Sci.
**5757**, 35–46 (2009)MathSciNetCrossRefGoogle Scholar - 5.Sakai, D.: Labeling chordal graphs with a condition at distance two. SIAM J. Discret. Math.
**7**, 133–140 (1994)CrossRefGoogle Scholar - 6.Paul, S., Pal, M., Pal, A.: L(2, 1)-labeling of permutation and bipartite permutation graphs. Math. Comput. Sci. https://doi.org/10.1007/s11786-014-0180-2
- 7.Bodlaender, H.L., Kloks, T., Tan, R.B., Leeuwen, J.V.: Approximations for -colorings of graphs. Comput. J.
**47**(2), 193–204 (2004)CrossRefGoogle Scholar - 8.Calamoneri, T., Caminiti, S., Olariu, S., Petreschi, R.: On the L(h, k)-labeling of co-comparability graphs and circular-arc graphs. Networks
**53**(1), 27–34 (2009)MathSciNetCrossRefGoogle Scholar - 9.Georges, J.P., Mauro, D.W., Stein, M.I.: Labeling products of complete graphs with a condition at distance two. SIAM J. Discrete Math.
**14**, 28–35 (2000)MathSciNetCrossRefGoogle Scholar - 10.Georges, J.P., Mauro, D.W., Whittlesey, M.A.: Relating path coverings to vertex labelings with a condition at distance two. Discrete Math.
**135**, 103–111 (1994)MathSciNetCrossRefGoogle Scholar - 11.Jha, P.K.: Optimal L(2, 1)-labeling of Cartesian products of cycles, with an application to independent domination. IEEE Trans. Circuits and SystI.
**47**(10), 1531–1534 (2000)CrossRefGoogle Scholar - 12.Jha, P.K., Narayanan, A., Sood, P., Sundaram, K., Sunder, V.: On L(2, 1)-labelings of the Cartesian product of a cycle and a path. Ars Combin. 55 (2000)Google Scholar
- 13.Jha, P.K., Klavar, S., Vesel, A.: Optimal L(2, 1)-labelings of certain direct products of cycles and Cartesian products of cycles. Discrete Appl. Math.
**152**, 257–265 (2005)MathSciNetCrossRefGoogle Scholar - 14.Klavar, S., Vesel, A.: Computing graph invariants on rotagraphs using dynamic algorithm approach: the case of (2, 1)-colorings and independence numbers. Discrete Appl. Math.
**129**, 449–460 (2003)MathSciNetCrossRefGoogle Scholar - 15.Whittlesey, M.A., Georges, J.P., Mauro, D.W.: On the number of Qn and related graphs. SIAM J. Discrete Math.
**8**, 499–506 (1995)MathSciNetCrossRefGoogle Scholar - 16.Hale, W.K.: Frequency assignment: Theory and applications. Proc. IEEE.
**68**, 1497–1514 (1980)CrossRefGoogle Scholar - 17.Krl, D., Skrekovski, R.: A theory about channel assignment problem. SIAM J. Discret. Math.
**16**, 426–437 (2003)CrossRefGoogle Scholar - 18.Havet, F., Reed, B., Sereni, J.S.: L(2, 1)-labeling of graphs, In: Proceedings of the 19th Annual ACMSIAM Symposium on Discrete Algorithms, SODA 2008, SIAM, pp. 621–630 (2008)Google Scholar
- 19.Schwarza, C., Troxellb, D.S.: L(2, 1)-labelings of Cartesian products of two cycles. Discret. Appl. Math.
**154**, 1522–1540 (2006)MathSciNetCrossRefGoogle Scholar