A New Approach for Graph Coloring

A New Approach for Graph Coloring

Author Name : Sapna Arya, Manish Dixit

ABSTRACT  This paper describes about the frequency assignment problem of graph coloring. An efficient algorithm has been proposed to provide least frequencies to the cells of the given area. The proposed algorithm is applicable to all types of graphs. The algorithm searches for the neighbors of the first vertex colored and then looks for the further coloring based on the algorithm proposed. We compare our results with the base frequency allocation algorithm in terms of time utilization to cover all the graphs and the frequencies allocated to the cells. Experiments have been conducted on the previously used graphs both standard and random so as to easily demonstrate te results and the effectiveness of the algorithm applied.