New Algorithm for Chromatic Number of Graphs and their Applications

Graph Colouring is a chief element in graph theory with tremendous applicability in computer science like data mining, clustering, networking, image segmentation etc. And a variety of implementations in aircraft scheduling, register allocation, sudoku, mobile networking, etc. Various algorithms were contrived for vertex colouring. This paper defines the HB colour matrix method and its kinds. There are three types of such matrices, Vertex HB colour matrix (VHBCM), Edge HB Colour matrix (EHBCM), and Region HB colour matrix (RHBCM). Also, the HB colour matrix algorithm is developed using a special assignment method, which gives the chromatic number of the given graph. Further, the algorithm is used to develop the python program, giving time complexity O(n) and space complexity O(n2). Also, the output of the python program for some standard graphs is calculated. The Similar algorithm can be developed for edge and face colouring of the graphs. Colouring of the graph further can be extended to perfect colouring.

show abstract

New Algorithm for Chromatic Number of Graphs and their Applications

Cited by 2 publications

References 4 publications

Relation Between Perfect Colouring and Chromatic Number for Snake Graph Family

Relation Between Perfect Colouring and Chromatic Number for Snake Graph Family

Colouring of graphs by HB colour matrix algorithm method

Contact Info

Product

Resources

About