Implementation of Vertex Colouring Using Adjacency Matrix

Graph colouring is very useful when analysing graph traversal, degree of the vertex, analysing printed circuit boards, world map, mobile networks etc. In this article an attempt is made to analyse vertex colouring on small graphs, for that capital English alphabets are been considered which has different small shapes. English alphabets cover some possible shapes which can include the concepts of tree, parallel edges, loop and pendent vertex. Here adjacency matrixis used to analyse connectivity. There are different types of graphs like simple graphs which have no parallel edges and loops, trees, complete graphs etc. since it is difficult to consider all the variation capital alphabets of English are considered. Complex graphs are nothing but combination of simple graphs. Hence any methods implemented on simple graphs can be extended to complex graphs, so the capital English alphabets are considered.