Given a graph G=(V, E) of maximum degree Δ, denoting by d (x, y) the distance in G
between nodes x, y∈ V, an L (3, 2, 1)-labeling of G is an assignment l from V to the set of …

L (r, s, t)-labeling problem (L rst-LP) is an important topic in discrete mathematics due to its
various applications, like in frequency assignment in mobile communication systems, signal …

One of the important topics in the field of graph theory is graph labeling. $ L (3, 1) $-labeling
problem has been widely studied in the last four decades due to its wide applications …

In a graph G=(V, E), L (2, 1)-labelling is considered by a functionwhose domain is V and
codomain is set of non-negative integers with a condition that the vertices which are …

Graph labelling problems are widely investigated due to their practical significance. The FAP
stands for the “frequency assignment problem,” which entails allocating frequencies to all …

Given a graph 𝐺=(𝑉, 𝐸) of maximum degree Δ, denoting by 𝑑 (𝑥, 𝑦) the distance in 𝐺
between nodes 𝑥, 𝑦∈ 𝑉, an 𝐿 (3, 2, 1)-labeling of 𝐺 is an assignment 𝑙 from 𝑉 to the set of …

The channel assignment problem, popularly known as CAP, is one of the elementary and
much studied topic in the field of wireless communication. The basic purpose for studying …

This paper investigates unit disk graphs within the frameworks of fuzzy and neutrosophic
graphs, expanding upon the traditional study of intersection graphs. Unit disk graphs are …

Lšr; s; tŽ-labeling problem (Lrst-LP) is an important topic in discrete mathematics due to its
various applications, like in frequency assignment in mobile communication systems, signal …

An L (2, 1)− labeling (L21L) of a graph G=(V, E) is an assignment f from the node-set V to the
set {0, 1, 2, 3,...} so that adjoining nodes get numbers at least two apart, and nodes at …