Balance in Systems of Finite Sets with Applications
| dc.creator | Popescu,Dragoş-Radu | |
| dc.date | 2007 | |
| dc.date.accessioned | 2024-02-06T12:55:58Z | |
| dc.date.available | 2024-02-06T12:55:58Z | |
| dc.description | An extension of balance notion from the theory of signed graphs to the case of finite sets systems is presented. For a finite set T, a subset S ⊆ T and a family F of subsets of T we denote by δm (S|F) respectively δM (S|F) the minimum/maximum number of changes (addition or deletion of elements), without repetition, which transforms S into a set from F. We are especially interested in the particular case in which F is the group generated by a family of subsets X1,..., Xn ⊆ T with symmetric difference operation. The obtained results are applied to the theory of signed graphs. | |
| dc.format | text/html | |
| dc.identifier | https://doi.org/10.3217/jucs-013-11-1755 | |
| dc.identifier | https://lib.jucs.org/article/28899/ | |
| dc.identifier.uri | https://openrepository.mephi.ru/handle/123456789/9535 | |
| 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): 1755-1766 | |
| dc.subject | balancing signed graphs | |
| dc.title | Balance in Systems of Finite Sets with Applications | |
| dc.type | Research Article |