  We introduce the concept of a $k$-token signed graph and study some of its
combinatorial and algebraic properties. We prove that two switching isomorphic
signed graphs have switching isomorphic token graphs. Moreover, we show that
the Laplacian spectrum of a balanced signed graph is contained in the Laplacian
spectra of its $k$-token signed graph. Besides, we introduce and study the
unbalance level of a signed graph, which is a new parameter that measures how
far a signed graph is from being balanced. Moreover, we study the relation
between the frustration index and the unbalance level of signed graphs and
their token signed graphs.
