A sufficient condition for graphs to be \(\lambda_k\)-optimal (Q2446896)
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 6287303
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A sufficient condition for graphs to be \(\lambda_k\)-optimal |
scientific article; zbMATH DE number 6287303 |
Statements
A sufficient condition for graphs to be \(\lambda_k\)-optimal (English)
0 references
23 April 2014
0 references
edge-cut
0 references
\(k\)-restricted edge connectivity
0 references
\(\lambda_k\)-optimality
0 references
neighborhood
0 references
0 references
0.9402201771736144
0 references
0.9193561673164368
0 references
0.9150462746620178
0 references
0.9077890515327454
0 references
0.9002631306648254
0 references
