vix.ing · top · new · best · stats · spec

Realizing degree imbalances in directed graphs

1998/07/09 by Dhruv Mubayi, Mubayi, Dhruv, Todd G. Will +3
Computer Science · Mathematics · #05C20 #Algorithms and Data Compression #Combinatorics (math.CO) #Digital Image Processing Techniques #FOS: Mathematics #math.CO #msc:05C20 #semigroups and automata theory

paper · pdf · doi:10.48550/arxiv.math/9807043

5 pages

arxiv created 1998/07/09 · openalex publication_date 1998/07/09 · arxiv updated 2009/11/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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.

Related