About some robustness and complexity properties of \(G\)-graphs networks (Q2255041)

From MaRDI portal
Revision as of 16:52, 9 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    0 references
    0 references
    0 references
    6 February 2015
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    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