The Least Eigenvalue of a Graph with Chromatic Number Four
Tan Ying-ying · Journal of Anqing Teachers College · 2011
Let G be a simple graph with n vertices whose eigenvalues are defined as those of its adjacency matrix.In the paper,we determine the graph whose least eigenvalue attains the minimum among the graphs of given order with chromatic number four.