d-Lucky Labeling of Honeycomb Network
Keywords:
Colouring, d-lucky labeling, Honeycomb network, Honeycomb torus networkAbstract
Let f:V(G)⟶N be a labeling of the vertices of a graph G by positive integers. Let S(v) denote the sum of labels of the neighbors of the vertex v in G. If v is an isolated vertex of G we put S(v)=0. A labeling f is lucky if S(u)≠S(v) for every pair of adjacent vertices u and v. The lucky number of a graph G, denoted by η(G), is the least positive integer k such that G has a lucky labeling with {1,2,…k} as the set of labels. Let l:V(G)⟶ {1,2,…k} be a labeling of the vertices of a graph G by positive integers. Define c(u)=d(u) + ∑_(v∈N(u))▒〖l(v)〗 where d(u) denotes the degree of u and N(u) denotes the neighbourhood of u. We define a labeling l as d-lucky if c(u)≠c(v), for every pair of adjacent vertices u and v in G. The d-lucky number of a graph G, denoted by η_dl (G), is the least positive integer k such that G has a d-lucky labeling with {1,2,…k} as the set of labels. In this paper, we study d-lucky labeling of Honeycomb network and Honeycomb torus network. Further we have obtained the d-lucky number for Honeycomb network and Honeycomb torus network.
References
[1] A. Ahai, A. Dehghan, M. Kazemi, E. Mollaahmedi, “Computation of Lucky number of planar graphs is NP-hard”, Information Processing Letters, vol.112,No.4,109-112,2012.
[2] D Ahima Emilet, Indra Rajasingh, “d-Lucky Labeling of Cycle of ladder, n-sunlet and Helm graphs,” International Journal of Pure and Applied Mathematics,vol.109, No.10, 219-227, 2016.
[3]S. Akhari, M. Ghanbari, R. Manariyat, S. Zare, “On the lucky choice number of graphs”, Graphs and Combinatorics, Vol. 29,No.2, 157-163, 2013.
[4] D Antony Xavier , R C Thivyarathi, “Proper Lucky Number of Hexagonal Mesh and Honeycomb Network,” International Journal of Mathematics Trends and Technology, vol. 48, No. 4 August 2017.
[5] D Antony Xavier , R C Thivyarathi, “Proper Lucky Number of Torus Network”, International Journal of Pure and Applied Mathematics,vol.117, No.13, 421-427, 2017.
[6] S. Czerwinski, J. Grytczuk, V. Zelazny, “Lucky labeling of graphs”, Information Processing Letters, Vol.109,No.18,1078-1081, 2009.
[7] Indra Rajasigh, S. Teresa Arockiamary, “Total Edge Irregularity Strength of Honeycomb Torus Networks”, Global Journal of Pure and Applied Mathematics,vol.13, No.4,1135-1142, 2017.
[8] Mikra Miller, Indra Rajasingh, D Ahima Emilet, D Azubha Jemilet, “d-Lucky Labeling of Graphs,” Procedia computer Science 57, 766-771, 2015.
[9] P. Sivagami, Indra Rajasingh, Sharmila Mary Arul, “On 3-Rainbow Domination in Hexagonal networks and Honeycomb Networks” , International Journal of Pure and Applied Mathematics,vol.101, No.5,839-847, 2015.
Downloads
Published
How to Cite
Issue
Section
License
This work is licensed under a Creative Commons Attribution 4.0 International License.
Authors contributing to this journal agree to publish their articles under the Creative Commons Attribution 4.0 International License, allowing third parties to share their work (copy, distribute, transmit) and to adapt it, under the condition that the authors are given credit and that in the event of reuse or distribution, the terms of this license are made clear.
