Reducing the maximum degree of a graph by deleting vertices: the extremal cases (Q5225550)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Reducing the maximum degree of a graph by deleting vertices: the extremal cases |
scientific article; zbMATH DE number 7084025
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Reducing the maximum degree of a graph by deleting vertices: the extremal cases |
scientific article; zbMATH DE number 7084025 |
Statements
Reducing the maximum degree of a graph by deleting vertices: the extremal cases (English)
0 references
22 July 2019
0 references
\(\Delta\)-reducing set
0 references
dominating set
0 references
0.9324126243591307
0 references
0.8610823154449463
0 references
0.8610525727272034
0 references
0.8376531600952148
0 references
