Characterization of 2-path signed network (Q2221636)

Summary: A \textit{signed network} is a network where each edge receives a sign: positive or negative. In this paper, we report our investigation on \textit{2-path signed} network of a given signed network \(\Sigma\), which is defined as the signed network whose vertex set is that of \(\Sigma\) and two vertices in \((\Sigma)_2\) are adjacent if there exist a path of length two between them in \(\Sigma\). An edge \(ab\) in \((\Sigma)_2\) receives a negative sign if all the paths of length two between them are negative, otherwise it receives a positive sign. A signed network is said to be if \textit{clusterable} its vertex set can be partitioned into pairwise disjoint subsets, called \textit{clusters}, such that every negative edge joins vertices in different clusters and every positive edge joins vertices in the same clusters. A signed network is \textit{balanced} if it is clusterable with exactly two clusters. A signed network is \textit{sign-regular} if the number of positive (negative) edges incident to each vertex is the same for all the vertices. We characterize the 2-path signed graphs as balanced, clusterable, and sign-regular along with their respective algorithms. The 2-path network along with these characterizations is used to develop a theoretic model for the study and control of interference of frequency in wireless communication networks.