Vol. 3, Issue 5 (2018)
A study on Colour Graphs
Author(s): Sandeep Kumar, Dr. Rishikant Agnihotri
Abstract: As the coloring of graph is concerned that the two adjacent vertices will not have a same color. That is, all the vertices of the graph may and may not have the same color. For example if the graph is complete graph then all the vertices of the graph will contain the different colors. It the graph is regular graph then it may be possible that the two vertices which are not adjacent, will have the same color. The vertices in the graph may defined as the label and the graph which have the color is called the chromatic number. The chromatic number is directly associated of the different color of the graph.