An Efficient Way to Determine the Chromatic Number of a Graph Directly from its Input Realizable Sequence

Spectral graph theory is a popular topic in modern day applied mathematics. Spectral graph theoretic techniques are widely used to extract a large variety of information about different properties of a graph from its adjacency matrix. A well known physical property of a graph is its chromatic number. In this paper, we have proposed an efficient approach to determine chromatic number of a graph directly from a realizable sequence. The method involves construction of adjacency matrix corresponding to an input sequence followed by calculation of eigen values to determine the bounds of chromatic number and consequently its chromatic number.