Degree sequences and majorization (Q1322868): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0024-3795(94)90349-2 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2047229463 / rank | |||
Normal rank |
Revision as of 03:14, 20 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Degree sequences and majorization |
scientific article |
Statements
Degree sequences and majorization (English)
0 references
26 January 1995
0 references
The authors define the majorization gap of a degree sequence as the minimum number of successive reverse-unit-transformations required to transform it into a threshold sequence (i.e., the degree sequence of a threshold graph). They deduce a formula for the majorization gap (by establishing a lower bound for it and exhibiting reverse-unit- transformations achieving the bound). They also show that the majorization gap is equal to the so-called threshold gap and characterize the maximum majorization gap for a fixed number of edges or vertices. The contents of used notions must be consulted in the paper.
0 references
majorization gap
0 references
degree sequence
0 references
threshold sequence
0 references
threshold gap
0 references