TY - JOUR A2 - Conforto, Silvia AU - Sinha, Deepa AU - Sharma, Deepakshi PY - 2017 DA - 2017/07/06 TI - Characterization of 2-Path Product Signed Graphs with Its Properties SP - 1235715 VL - 2017 AB - A signed graphis a simple graph where each edge receives a sign positive or negative. Such graphs are mainly used in social sciences where individuals represent vertices friendly relation between them as a positive edge and enmity as a negative edge. In signed graphs, we define these relationships (edges) as of friendship (“ + ” edge) or hostility (“ - ” edge). A 2-path product signed graph S # ^ S of a signed graph S is defined as follows: the vertex set is the same as S and two vertices are adjacent if and only if there exists a path of length two between them in S . The sign of an edge is the product of marks of vertices in S where the mark of vertex u in S is the product of signs of all edges incident to the vertex. In this paper, we give a characterization of 2-path product signed graphs. Also, some other properties such as sign-compatibility and canonically-sign-compatibility of 2-path product signed graphs are discussed along with isomorphism and switching equivalence of this signed graph with 2-path signed graph. SN - 1687-5265 UR - https://doi.org/10.1155/2017/1235715 DO - 10.1155/2017/1235715 JF - Computational Intelligence and Neuroscience PB - Hindawi KW - ER -