Abstract

The computation of the chromatic number of circulant graph is essentially hard as in the general case. However in this case it is possible to use spectral properties of the graph to obtain a good coloration. In this paper we use these properties to construct two heuristic algorithms to color a circulant graph. In the case of sparse graphs, we show that our heuristic algorithms give results better than the classical ones.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

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.