On Lh,k-Labeling Index of Inverse Graphs Associated with Finite Cyclic Groups

K. Mageshwaran, G. Kalaimurugan, Bussakorn Hammachukiattikul, Vediyappan Govindan, Ismail Naci Cangul and Ljubisa Kocinac

Journal of Mathematics, 2021, vol. 2021, 1-7

Abstract: An Lh,k-labeling of a graph G=V,E is a function f:V⟶0,∞ such that the positive difference between labels of the neighbouring vertices is at least h and the positive difference between the vertices separated by a distance 2 is at least k. The difference between the highest and lowest assigned values is the index of an Lh,k-labeling. The minimum number for which the graph admits an Lh,k-labeling is called the required possible index of Lh,k-labeling of G, and it is denoted by λkhG. In this paper, we obtain an upper bound for the index of the Lh,k-labeling for an inverse graph associated with a finite cyclic group, and we also establish the fact that the upper bound is sharp. Finally, we investigate a relation between Lh,k-labeling with radio labeling of an inverse graph associated with a finite cyclic group.

Date: 2021
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/jmath/2021/5583433.pdf (application/pdf)
http://downloads.hindawi.com/journals/jmath/2021/5583433.xml (application/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jjmath:5583433

DOI: 10.1155/2021/5583433

Access Statistics for this article

More articles in Journal of Mathematics from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().