Cycle and Circle Tests of Balance in Gain Graphs: Forbidden Minors and Their Groups
<|reference_start|>Cycle and Circle Tests of Balance in Gain Graphs: Forbidden Minors and Their Groups: 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.<|reference_end|>
@article{rybnikov2002cycle,
    title={Cycle and Circle Tests of Balance in Gain Graphs: Forbidden Minors and
  Their Groups},
    author={Konstantin Rybnikov (University of Massachusetts at Lowell and MSRI),
  Thomas Zaslavsky (Binghamton University)},
    journal={J. Graph Theory, 51 (2006), no. 1, 1--21.},
    year={2002},
    archivePrefix={arXiv},
    eprint={math/0209316},
    primaryClass={math.CO cs.DM cs.DS}
}