Realizing degree imbalances in directed graphs

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.
5 pages

Keywords

Combinatorics, 05C20

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/77139

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/9807043
 http://arxiv.org/abs/math/9807043

Collections

arXiv