Frustration in signed graphs
Combinatorics
2014-03-31 v1
Abstract
Zaslavsky conjectured the following: The minimum number of vertices to be deleted to restore balance in a subcubic signed graph is the same as the minimum number of edges to be deleted to restore balance. We prove this conjecture. Also, we obtain a bound for these invariants in a special class of signed graphs.
Keywords
Cite
@article{arxiv.1403.7212,
title = {Frustration in signed graphs},
author = {Vaidy Sivaraman},
journal= {arXiv preprint arXiv:1403.7212},
year = {2014}
}
Comments
3 pages