About some robustness and complexity properties of \(G\)-graphs networks (Q2255041): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
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
Property / cites work
 
Property / cites work: Symmetric presentations of Abelian groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2753924 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial characterizations of clique-perfect graphs II: Diamond-free and Helly circular-arc graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3024729 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cayley graphs and \(G\)-graphs: some applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(G\)-graphs: a new representation of groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: G-graphs: An efficient tool for constructing symmetric and semisymmetric graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Property of Hamming Graphs and Mesh of d-ary Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Graphs Without Multicliqual Edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: New methods for using Cayley graphs in interconnection networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Feasibility conditions for the existence of walk-regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of recognizing Hamming graphs and related classes of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3877854 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding and counting small induced subgraphs efficiently / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3317150 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3812449 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4858090 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incidence Graphs of Bipartite G-Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3635509 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On automorphisms permuting generators in groups of rank two / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 15:52, 9 July 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
    0 references
    0 references
    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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references