JUCS - Journal of Universal Computer Science 13(11): 1779-1790, doi: 10.3217/jucs-013-11-1779
Connectivity and Reachability in Signed Networks
expand article infoMonica Tătărâm‡
‡ Faculty of Mathematics and Informatics, Bucharest, Romania

Corresponding author: Monica Tătărâm ( tataram@fmi.unibuc.ro )

© Monica Tătărâm.
This article is freely available under the J.UCS Open Content License.
Citation: Tătărâm M (2007) Connectivity and Reachability in Signed Networks. JUCS - Journal of Universal Computer Science 13(11): 1779-1790. https://doi.org/10.3217/jucs-013-11-1779
Open Access
Abstract
For modeling real-life situations where not only the intensity of the relation existing between elements but also its polarity is important, we have proposed (see [Marcus and Tataram 1987a]) a new type of graphs: the signed networks. In the present paper we study two of thier most important properties: connectivity and reachability, and try to use them in order to offer a strategy to improve communication in social or professional groups.
Keywords
graph theory, connectivity, geodesics