Characterization of 2-Path Signed Network

Deepa Sinha and Deepakshi Sharma

Complexity, 2020, vol. 2020, 1-13

Abstract:

A signed network is a network where each edge receives a sign: positive or negative. In this paper, we report our investigation on 2-path signed network of a given signed network , which is defined as the signed network whose vertex set is that of and two vertices in 2 are adjacent if there exist a path of length two between them in . An edge ab in 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 clusterable its vertex set can be partitioned into pairwise disjoint subsets, called 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 balanced if it is clusterable with exactly two clusters. A signed network is 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.

Date: 2020
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/8503/2020/1028941.pdf (application/pdf)
http://downloads.hindawi.com/journals/8503/2020/1028941.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:complx:1028941

DOI: 10.1155/2020/1028941

Access Statistics for this article

More articles in Complexity from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().