Balanced Abelian group valued functions on directed graphs
Combinatorics
2013-03-26 v2
Abstract
We discuss functions from the edges and vertices of a directed graph to an Abelian group. Such functions, when the sum of their values along any cycle is zero, are called balanced and form an Abelian group. We study this group in two cases: when we allowed to walk against the direction of an edge taking the opposite value of the function and when we are not allowed to walk against the direction.
Keywords
Cite
@article{arxiv.1303.5456,
title = {Balanced Abelian group valued functions on directed graphs},
author = {Yonah Cherniavsky and Avraham Goldstein and Vadim E. Levit},
journal= {arXiv preprint arXiv:1303.5456},
year = {2013}
}
Comments
9 pages