Azeem Haider1,*, Ali N.A. Koam1, Ali Ahmad2
Intelligent Automation & Soft Computing, Vol.30, No.3, pp. 787-794, 2021, DOI:10.32604/iasc.2021.019391
Abstract Graph labeling is useful in networks because each transmitter has a different transmission capacity to send or receive wired or wireless links. An interference of signals can occur when transmitters that are close together receive close frequencies. This problem has been modeled mathematically in the radio labeling problem on graphs, where vertices represent transmitters and edges indicate closeness of the transmitters. For this purpose, each vertex is labeled with a unique positive integer, and to minimize the interference, the difference between maximum and minimum used labels has to be minimized. A radio labeling for a graph is a function from… More >
Login
Register
