A graph labeling is an assignment of integers to the vertices or edges, or both, subject to
certain conditions. Graph labelings were first introduced in the mid 1960s. In the intervening …

A radio labeling of a graph G is a mapping f: V (G)→{0, 1, 2,...} such that| f (u)− f (v)|⩾ d (G)+
1− d (u, v) holds for every pair of vertices u and v, where d (G) is the diameter of G and d (u …

For a positive integer k, a radio k-coloring of a simple connected graph G=(V (G), E (G)) is a
mapping f: V (G) → {0, 1, 2, ...\} f: V (G)→ 0, 1, 2,… such that| f (u)-\, f (v)| ≥ k+ 1-d (u,\, v)| f (u) …

Let G be a graph with diameter d. A radio labelling of G is a function f that assigns to each
vertex with a non-negative integer such that the following holds for all vertices u, v:| f (u)− f …

Labeling of graphs has defined many variations in the literature, eg, graceful, harmonious,
and radio labeling. Secrecy of data in data sciences and in information technology is very …

A radio labeling of a graph G is a mapping φ: V (G) → {0, 1, 2, ...\} such that| φ (u)-φ (v)| ≥
diam (G)+ 1-d (u, v) for every pair of distinct vertices u, v of G, where diam (G) and d (u, v) are …

Radio k-coloring of graphs is one of the variations of frequency assignment problem. For a
simple connected graph G and a positive integer k⩽ diam (G), a radio k-coloring is an …

Motivated by the channel assignment problem, we study the radio labeling of graphs. The
radio labeling problem is an important topic in discrete mathematics due to its diverse …

Abstract Let G=(V (G), E (G)) be a simple connected graph. For any two distinct vertices u
and v, d (u, v) represents the distance between u and v. Suppose k be any positive integer …

The communication in a wireless network mainly depends on the frequencies or channels
assigned to them. The channels must be assigned to all the transmitters in the network …