About some robustness and complexity properties of \(G\)-graphs networks (Q2255041)
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 6399140
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | About some robustness and complexity properties of \(G\)-graphs networks |
scientific article; zbMATH DE number 6399140 |
Statements
About some robustness and complexity properties of \(G\)-graphs networks (English)
0 references
6 February 2015
0 references
\(G\)-graphs
0 references
orbit graphs
0 references
optimal connectivity
0 references
vertex and edge-transitivity
0 references
robustness
0 references
network
0 references
Hamming graphs
0 references
clique graphs
0 references
0 references
0 references
0.8782908
0 references
0 references
0.86814433
0 references
0 references
