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 simple graph is called cordial if it admits 0‐1 labeling that satisfies certain conditions. The
second order of lemniscate graph is a graph of two second order of circles that have one …

Linear programming is an important approach that is used to represent a large class of
combinatorial optimization problems. The simplex algorithm is one of the algorithms for …

In this paper we used the cubic roots of unit group together with the concept of cordiality in
graph theory to introduce a new method of labeling, this construed cubic cordial labeling can …

A radio labeling of a simple connected graph G=(V, E) is a function h: V⟶ N such that| h (x)−
h (y)|≥ diam (G)+ 1− d (x, y), where diam (G) is the diameter of graph and d (x, y) is the …

This paper investigates the radio labeling of friendship networks (F 3, k, F 4, k, F 5, k, and F
6, k). In contrast, a mathematical model is proposed for determining the upper bound of radio …

The radio labeling problem has numerous applications including military communications,
satellite communication, mobile networks, and internet technology. This issue is NP-hard. A …