Minimally \((n,\lambda)\)-connected graphs of low order and maximal size (Q2573845)
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: Minimally \((n,\lambda)\)-connected graphs of low order and maximal size |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimally \((n,\lambda)\)-connected graphs of low order and maximal size |
scientific article |
Statements
Minimally \((n,\lambda)\)-connected graphs of low order and maximal size (English)
0 references
24 November 2005
0 references
complete bipartite graph
0 references
0.9457504
0 references
0.92096704
0 references
0.9140164
0 references
0.91349936
0 references
0.9129167
0 references
0.91006666
0 references
0.9088922
0 references
0.90767276
0 references
0.90766585
0 references
0.90630376
0 references
