On Integer Balancing of Digraphs
Optimization and Control
2020-11-20 v2 Discrete Mathematics
Combinatorics
Abstract
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.
Keywords
Cite
@article{arxiv.2011.08364,
title = {On Integer Balancing of Digraphs},
author = {Mohamed-Ali Belabbas and Xudong Chen},
journal= {arXiv preprint arXiv:2011.08364},
year = {2020}
}