Conditional connectivity for \((n,k)\)-arrangement graphs (Q2858737)
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: Conditional connectivity for (n,k)-arrangement graphs |
scientific article; zbMATH DE number 6229870
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Conditional connectivity for \((n,k)\)-arrangement graphs |
scientific article; zbMATH DE number 6229870 |
Statements
19 November 2013
0 references
fault tolerance
0 references
conditional connectivity
0 references
\((n, k)\)-arrangement graph
0 references
Conditional connectivity for \((n,k)\)-arrangement graphs (English)
0 references
0.929875373840332
0 references
0.8199883103370667
0 references
0.8167973756790161
0 references
0.8106979131698608
0 references
0.8081135153770447
0 references
