By adjacency matrix algorithm for the chromatic number of a graph
Author & Affiliation:
Shantharaju. C. V.
Lecturer in Mathematics, Govt. PU College for Boys, Arakalgud, Hassan - 573102 (INDIA)
Veena Mathad
Department of Studies in Mathematics, Mansagangotri, University, of Mysore, Mysore - 570 006 (INDIA)
Keyword:
Chromatic number, color class
Issue Date:
April 2010
Abstract:
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 X(G) 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.
Pages:
356-358
ISSN:
2319-8044 (Online) - 2231-346X (Print)
Source:
PDF:
DOI:
jusps-A
Share This:
Copy the following to cite this article:
S. C. V. ; V. Mathad, "By adjacency matrix algorithm for the chromatic number of a graph", Journal of Ultra Scientist of Physical Sciences, Volume 22, Issue 1, Page Number 356-358, 2018Copy the following to cite this URL:
S. C. V. ; V. Mathad, "By adjacency matrix algorithm for the chromatic number of a graph", Journal of Ultra Scientist of Physical Sciences, Volume 22, Issue 1, Page Number 356-358, 2018Available from: https://www.ultrascientist.org/paper/1065/
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License
