Connectivity and Reachability in Signed Networks
| dc.creator | Tătărâm,Monica | |
| dc.date | 2007 | |
| dc.date.accessioned | 2024-02-06T12:55:58Z | |
| dc.date.available | 2024-02-06T12:55:58Z | |
| dc.description | 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. | |
| dc.format | text/html | |
| dc.identifier | https://doi.org/10.3217/jucs-013-11-1779 | |
| dc.identifier | https://lib.jucs.org/article/28901/ | |
| dc.identifier.uri | https://openrepository.mephi.ru/handle/123456789/9537 | |
| dc.language | en | |
| dc.publisher | Journal of Universal Computer Science | |
| dc.relation | info:eu-repo/semantics/altIdentifier/eissn/0948-6968 | |
| dc.relation | info:eu-repo/semantics/altIdentifier/pissn/0948-695X | |
| dc.rights | info:eu-repo/semantics/openAccess | |
| dc.rights | J.UCS License | |
| dc.source | JUCS - Journal of Universal Computer Science 13(11): 1779-1790 | |
| dc.subject | graph theory | |
| dc.subject | connectivity | |
| dc.subject | geodesics | |
| dc.title | Connectivity and Reachability in Signed Networks | |
| dc.type | Research Article |