On Eigenvalues of Signed Graphs

In this paper, we study signed graphs whose signed adjacency matrices have full rank. Among other results, we show that there is a sign for an arbitrary simple graph so that the signed adjacency matrix is full rank if and only if the underlying graph has a spanning subgraph which is a disjoint union of some copies of K 2 and some cycles.