Radio fuzzy graphs and assignment of frequency in radio stations

Abstract

Based on the rules of the Federal Communications Commission (FCC) of the United States, there is a problem when FM radio stations are situated nearby and transmit on channels when they are satisfactorily far separated. The difficulty of taking an optimal assignment of channels for a particular set of radio stations according to some given limitations on the distances among the stations as well as other factors are referred to as the Channel Assignment Problem. That problem has been designed mathematically in different ways. In this problem, it is managed by the introduction of radio k-colourings of graphs for assignment of frequency in radio stations. Depending on radio distances, radio fuzzy graphs have been defined. Complete radio fuzzy graphs, cyclic radio fuzzy graphs, and star radio fuzzy graphs are introduced, and several properties have been proved. Based on these theories, a survey on Kolkata (India) radio stations has been verified. © 2022 Elsevier B.V., All rights reserved.