Abstract
Objectives: In radio networks, the main difficulty is managing the radio spectrum, assigning radio frequencies to transmitters optimally without any interferences. This study aims to find the smallest span of Mycielski of some graphs, the maximum color assigned to any node is called span. Methods : This study focused on the problem of reducing interference by modeling it with a radio k - coloring problem on graphs. Where transmitters are modeled as nodes in a graph, with edges connecting nodes that represent transmitters in close proximity to one another. For a graph , with node set , edge set and an integer , a radio k - coloring of is a function satisfying the condition for any two nodes and , where is the distance between and in . The radio k - coloring of , is the maximum color assigned to any node of and it is denoted by . The radio k -chromatic number of is the minimum value of taken over all radio k - coloring of and it is denoted by . Findings: This study obtained the radio k-chromatic number for Mycielski of some graphs for and 3 Novelty: To solve the channel assignment problem in radio transmitters, the interference graph is developed, and the channel assignment has been converted into a graph coloring. Reducing the interference by a radio k - coloring problem will motivate many researchers to find the radio k - coloring in various graphs. Keywords: Radio k – Coloring, Mycielski graph, Double Star graph, Triple Star graph, Sunlet graph, Helm graph and Closed Helm graph
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.