International Journal of Advanced Research and Development

International Journal of Advanced Research and Development


International Journal of Advanced Research and Development
International Journal of Advanced Research and Development
Vol. 3, Issue 5 (2018)

A study on Colour Graphs


Sandeep Kumar, Dr. Rishikant Agnihotri

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.
Download  |  Pages : 96-97
How to cite this article:
Sandeep Kumar, Dr. Rishikant Agnihotri. A study on Colour Graphs. International Journal of Advanced Research and Development, Volume 3, Issue 5, 2018, Pages 96-97
International Journal of Advanced Research and Development