Formally, a signed graphS is a pair () that consists of a graph and a sign mapping called signature from E to the sign group {+, -}. Given a signed graph S and a positive integer t, the t-path signed graph of S is a signed graph whose vertex set is V(S) and two vertices are adjacent if and only if there exists a path of length t between these vertices and then by defining its sign to be '-' if and only if in every such path of length t in S all the edges are negative. The negation of a signed graph S is a signed graph obtained from S by reversing the sign of every edge of S. Two signed graphs and on the same underlying graph are switching equivalent if it is possible to assign signs ' ' ('plus') or ' ' ('minus') to the vertices of such that by reversing the sign of each of its edges that have received opposite signs at its ends, one obtains. In this paper, we characterize signed graphs whose negations are switching equivalent to their t-path signed graphs for and also characterize signed graphs such that the spectrum of their t-path signed graphs, where , and 2, is symmetric about the origin. [ABSTRACT FROM AUTHOR]