On 2-Path Signed Graphs

A signed graph (sigraph) is a graph where each edge receives positive or negative sign. In this paper, we report our investigation on a new signed graph (S) 2 called 2-path sigraphs of a given sigraph S defined as that sigraph whose vertex set is the vertex set of S and two vertices in (S) 2 are adjacent if there exist a path of length two between them in S and negatively signed if all the paths of length two between them are all-negative, otherwise positively signed.