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

DOI10.1016/j.dam.2014.11.003zbMath1306.05230OpenAlexW2039293320MaRDI QIDQ2255041

Marc Demange, Ruxandra Marinescu-Ghemeci, Jean-François Culus, Cerasela Tanasescu

Publication date: 6 February 2015

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2014.11.003

zbMATH Keywords

networkrobustnessclique graphsHamming graphsorbit graphs\(G\)-graphsoptimal connectivityvertex and edge-transitivity

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph theory (including graph drawing) in computer science (68R10) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Connectivity (05C40) Graph operations (line graphs, products, etc.) (05C76)

Related Items

On constructing expander families of G-graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finding and counting small induced subgraphs efficiently
• Cayley graphs and \(G\)-graphs: some applications
• G-graphs: An efficient tool for constructing symmetric and semisymmetric graphs
• Partial characterizations of clique-perfect graphs II: Diamond-free and Helly circular-arc graphs
• Feasibility conditions for the existence of walk-regular graphs
• New methods for using Cayley graphs in interconnection networks
• On automorphisms permuting generators in groups of rank two
• On the complexity of recognizing Hamming graphs and related classes of graphs
• \(G\)-graphs: a new representation of groups
• Symmetric presentations of Abelian groups
• A New Property of Hamming Graphs and Mesh of d-ary Trees
• On Graphs Without Multicliqual Edges
• Incidence Graphs of Bipartite G-Graphs