Balanced Abelian group-valued functions on directed graphs

Yonah Cherniavsky, Avraham Goldstein, Vadim E. Levit


We discuss functions from the edges and vertices of a directed graph to an Abelian group. A function is called balanced if the sum of its values along any cycle is zero. The set of all balanced functions forms an Abelian group under addition. We study this group in two cases: when we are 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.


Consistent graphs, balanced signed graphs, balanced labelings of graphs, gain graphs, weighted graphs

Full Text:


ISSN: 1855-3974

Issues from Vol 6, No 1 onward are partially supported by the Slovenian Research Agency from the Call for co-financing of scientific periodical publications