L(2,2,1)-labelling problems on square of path
by Sk Amanathulla; Madhumangal Pal
International Journal of Advanced Intelligence Paradigms (IJAIP), Vol. 29, No. 2/3, 2024

Abstract: L(p, q)-labelling problem is a well studied problem in the last three decades for its wide applications, specially in frequency assignment in (mobile) communication system, X-ray crystallography, coding theory, radar, astronomy, circuit design etc. L(2, 2, 1)-labelling is an extension of L(p, q)-labelling is now becomes a well studied problem due to its applications. Motivated from this point of view, we consider L(2, 2, 1)-labelling problem for squares of path. Let G = (V,E) be a graph. The L(2, 2, 1)-labelling of the graph G is a mapping η : V → {0, 1, 2, …} so that 'η(x) - η(y)' ≥ 2 if d(x, y) = 1 or 2, 'η(x) - η(y)' ≥ 1 if d(x, y) = 3, where V is the vertex set and d(x, y) is the distance (i.e. minimum number of edges in the shortest path between x and y) between the vertices x and y. λ_2,2,1(G) is the L(2, 2, 1)-labelling number of G, which is the largest non-negative integer which is used to label the graph G. In labelling problems of graph the main target is to find the exact value of λ_2,2,1(G) or to minimise it. In this paper, we have studied L(2, 2, 1)-labelling of squares of path and obtain a good result for it. Also a labelling procedure is presented to label a square of path. The result of this paper is exact and also it is unique. This is the first result about L(2, 2, 1)-labelling of squares of path.

Online publication date: Fri, 15-Nov-2024

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Advanced Intelligence Paradigms (IJAIP):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com