Indian Journal of Science and Technology

The PDF file you selected should load here if your Web browser has a PDF reader plug-in installed (for example, a recent version of Adobe Acrobat Reader).

If you would like more information about how to print, save, and work with PDFs, Highwire Press provides a helpful Frequently Asked Questions about PDFs.

Alternatively, you can download the PDF file directly to your computer, from where it can be opened using a PDF reader. To download the PDF, click the Download link above.

Fullscreen Fullscreen Off


Objectives: This paper aims towards giving colors optimally to the vertices of the graph so that graph coloring constraints can be satisfied. Methods: A hybridized algorithm that consists of Cuckoo Search along with LDO algorithm is proposed to show a comparative and more optimal algorithm for graph coloring problem. Findings: Graph coloring relates graph regions coloring in a way so that sequence of coloring will meet with all the constraints of coloring. Novelty: Hybridization of nature-inspired algorithm with Mantegna algorithm finds out the new nest positions when the nest having worst survival rate are destroyed. The Largest degree Ordering is utilized in assigning the color coding to the nodes with the nodes having the largest degree first. The experimental results prove that hybridized solution works well using moderate size and provides another approach for the same.

Keywords

Degree based Ordering, Graph Coloring.
User