The eigenvalues of signed graphs and its cheromatic number

Abstract

In this paper, we extend some results of Wilf's theorem for simple graphs to sighned graphs. we prove that chromatic number of graph G is less than sum of chromatic number of G^_, maximum eigenvalue and 2.