arXiv · 2409.02937
The Lorenz order in graph theory: A new proof and extension of the theorems of Hakimi and of Havel-Hakimi
Abstract
This paper studies the relation between the Lorenz majorization order and the realizability of degree sequences X of a network in the sense of being graphical or connected graphical (c-graphical) or not. We prove the main result that, if X is dominated (in the Lorenz majorization sense) by X' and X' is (c-) graphical, the X is also (c-) graphical. We present a simple proof and a generalization of the Havel-Hakimi theorem, using the Lorenz order formalism. From this, a classical result of Hakimi on trees follows but also a new generalization to general connected networks. From this, a characterization of c-graphical sequences in terms of the Lorenz majorization order is given.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Leo Egghe. 2024-08-23. The Lorenz order in graph theory: A new proof and extension of the theorems of Hakimi and of Havel-Hakimi. https://arxiv.org/abs/2409.02937
Cite the original work for its findings. Save a collection to share your selection of sources.