eng Ansari Education and Research Society Journal of Ultra Scientist of Physical Sciences April 2010 22 1 356 358 jusps-A 1065 article Shantharaju. C. V. 1 Veena Mathad 2 Lecturer in Mathematics, Govt. PU College for Boys, Arakalgud, Hassan - 573102 (INDIA) Department of Studies in Mathematics, Mansagangotri, University, of Mysore, Mysore - 570 006 (INDIA) <p style="text-align: justify;">A coloring of a graph is an assignment of colors to its vertices so that no two adjacent vertices receive the same color. An n-coloring of a graph G uses n colors. The chromatic number <em>_X(G)</em> of a graph G is the minimum n for which G has an n-coloring. In this paper, we give an algorithm to determine the chromatic number of a graph using adjacency matrix.<br /> &nbsp;</p> https://www.ultrascientist.org/paper/1065/ Chromatic number color class