1 paper · 1 filter
Beiyan Liu, Fang Duan
Suppose that I^=(G,I¨) is a connected signed graph with at least one cycle. The number of positive, negative and zero eigenvalues of the adjacency matrix of I^ are called posi…