About some robustness and complexity properties of \(G\)-graphs networks (Q2255041): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.dam.2014.11.003 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2039293320 / rank | |||
Normal rank | |||
Revision as of 02:15, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | About some robustness and complexity properties of \(G\)-graphs networks |
scientific article |
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
