Graph labelling problem has been broadly studied for a long period for its applications,
especially in frequency assignment in (mobile) communication system, X‐ray …

Real world applications of discrete mathematics Page 1 Malaya Journal of Matematik, Vol. 9, No.
1, 152-158, 2021 https://doi.org/10.26637/MJM0901/0025 Real world applications of discrete …

The partition dimension is a variant of metric dimension in graphs. It has arising applications
in the fields of network designing, robot navigation, pattern recognition and image …

For a given graph G=(V, E), the L (3, 2, 1)-and L (4, 3, 2, 1)-labeling problems assign the
labels to the vertices of G. Let Z∗ be the set of non-negative integers. An L (3, 2, 1)-and L (4 …

For a graph G=(V, E) the L (3, 1, 1)-labeling is a mapping μ from the vertex set V to the set of
non-negative integers {0, 1, 2,…} such that| μ (x)-μ (y)|≥ 3 if d (x, y)= 3 and| μ (x)-μ (y)|≥ 1 if …

In graph theory, one of the most important problems is graph labeling. Labeling of graph has
a very wide range of applications in x-ray crystallography, missile guidance, coding theory …

L (2, 1)-labeling problem is a well studied problem due to its wide applications, specially in
frequency assignment in (mobile) communication system, coding theory, X-ray …

Graph labeling problem has been broadly studied in recent past for its wide applications, in
mobile communication system for frequency assignment, radar, circuit design, X-ray …

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 …