Realizing degree imbalances in directed graphs
classification
🧮 math.CO
keywords
directedgraphimbalancesrealizablesequencealgorithmcharacterizedegree
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.