On Integer Balancing of Digraphs

11/17/2020

∙

by   Mohamed-Ali Belabbas, et al.

∙

0

∙

share

A weighted digraph is balanced if the sums of the weights of the incoming and of the outgoing edges are equal at each vertex. We show that if these sums are integers, then the edge weights can be integers as well.