Every graph is contained in a sparsest possible balanced graph (Q3705489)
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 3931062
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Every graph is contained in a sparsest possible balanced graph |
scientific article; zbMATH DE number 3931062 |
Statements
Every graph is contained in a sparsest possible balanced graph (English)
0 references
1985
0 references
global degree
0 references
local degree
0 references
balanced graph
0 references
0.8842676
0 references
0.85599476
0 references
0.8527226
0 references
0.84181505
0 references
