Realizing degree imbalances in directed graphs
Dhruv Mubayi, Todd G. Will, Douglas B. West
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.
Create a lesson
Related papers
A face polynomial invariant for embedded graphs
Hongxia Ma, Metrose Metsidik
Odd-ordered Cayley graphs satisfy Erdős--Gyárfás
Michael C. Burkhart
The Maximum Second Zagreb Spectral Radius of Trees, Unicyclic Graphs and Bicyclic Graphs
Juan Wang, Genjie Wang
A Low-Diameter Nash-Williams--Tutte Theorem
Pin-Hsian Lee, Peng-Ting Lin, Meng-Tsung Tsai et al.
A Short Proof and Generalization of the Rainbow Cycle Theorem and Improved Bounds for Binary Even-Query LCCs
Andrew D. Lin
Automaticity of structural defects in fixed points of block substitutions
Lior Tenenbaum