The maximum corank of graphs with a 2-separation (Q2477537)
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 5249406
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The maximum corank of graphs with a 2-separation |
scientific article; zbMATH DE number 5249406 |
Statements
The maximum corank of graphs with a 2-separation (English)
0 references
14 March 2008
0 references
minimum rank
0 references
graph
0 references
symmetric matrix
0 references
separation
0 references
connectivity
0 references
0.7896914482116699
0 references
0.7706495523452759
0 references
0.7558218836784363
0 references
0.7390088438987732
0 references
0.7320354580879211
0 references
