Realizing degree imbalances in directed graphs
组合数学
2007-05-23 v1
摘要
In a directed graph, the imbalance of a vertex is its outdegree minus its indegree. We characterize the sequences that are realizable as the sequence of imbalances of a simple directed graph. Moreover, a realization of a realizable sequence can be produced by a greedy algorithm.
引用
@article{arxiv.math/9807043,
title = {Realizing degree imbalances in directed graphs},
author = {Dhruv Mubayi and Todd G. Will and Douglas B. West},
journal= {arXiv preprint arXiv:math/9807043},
year = {2007}
}
备注
5 pages