Cycle and circle tests of balance in gain graphs: Forbidden minors and their groups

From MaRDI portal
Publication:3376685

DOI10.1002/JGT.20116zbMATH Open1085.05033arXivmath/0209316OpenAlexW2950382608MaRDI QIDQ3376685FDOQ3376685


Authors: Thomas Zaslavsky, K. A. Rybnikov Edit this on Wikidata


Publication date: 24 March 2006

Published in: Journal of Graph Theory (Search for Journal in Brave)

Abstract: We examine two criteria for balance of a gain graph, one based on binary cycles and one on circles. The graphs for which each criterion is valid depend on the set of allowed gain groups. The binary cycle test is invalid, except for forests, if any possible gain group has an element of odd order. Assuming all groups are allowed, or all abelian groups, or merely the cyclic group of order 3, we characterize, both constructively and by forbidden minors, the graphs for which the circle test is valid. It turns out that these three classes of groups have the same set of forbidden minors. The exact reason for the importance of the ternary cyclic group is not clear.


Full work available at URL: https://arxiv.org/abs/math/0209316




Recommendations




Cites Work


Cited In (3)





This page was built for publication: Cycle and circle tests of balance in gain graphs: Forbidden minors and their groups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3376685)