Independence and the Havel-Hakimi residue (Q1322229)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 562631
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Independence and the Havel-Hakimi residue |
scientific article; zbMATH DE number 562631 |
Statements
Independence and the Havel-Hakimi residue (English)
0 references
9 June 1994
0 references
It is known that for every graph \(G\) the number of zeros left after fully reducing the degree sequences (as in the Havel-Hakimi theorem) is at most the independence number of \(G\) (cf. \textit{O. Favaron}, \textit{M. Mahéo} and \textit{J.-F. Saclé} [J. Graph Theory 15, No 1, 39-64 (1991; Zbl 0751.05075)]). In the present paper the authors find how the residue relates to a natural greedy algorithm for constructing large independent sets in \(G\).
0 references
degree sequences
0 references
Havel-Hakimi theorem
0 references
independence number
0 references
residue
0 references
greedy algorithm
0 references
independent sets
0 references
0.8681964874267578
0 references
0.8638903498649597
0 references
0.8019849061965942
0 references
0.7828636765480042
0 references
