scientific article; zbMATH DE number 7055493

MaRDI QIDQ5741889zbMATH OpenFDO

Authors Cerasela Tanasescu, Ruxandra Marinescu-Ghemeci

Publication date 16 May 2019

zbMATH Keywords

\(G\)-graphsconnectivityedge-transitivitynetworkoptimally connectedrobustnessvertex-transitivity

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Connectivity (05C40) Small world graphs, complex networks (graph-theoretic aspects) (05C82)

Recommendations

• About some robustness and complexity properties of G-graphs networks
• Publication:4862353
• Note on robust critical graphs with large odd girth
• Robust \(\ell_2\)-hypergraph and its applications
• Robustness of graph properties
• Robustness of random graphs based on graph spectra
• Characterization of robustness and resilience in graphs: a mini-review
• Robust graph ideals
• Hardness of robust graph isomorphism, Lasserre gaps, and asymmetry of random graphs
• Various results on the toughness of graphs

Cited in

(8)

• Gaussian fields and Gaussian sheets with generalized Cauchy covariance structure
• The robustness of LWPP and WPP, with an application to graph reconstruction
• About some robustness and complexity properties of G-graphs networks
• Symmetry and connectivity in G-graphs
• Tree robustness of a graph
• Incidence graphs of bipartite \(G\)-graphs
• Symmetric and semisymmetric graphs construction using G-graphs
• Robust graph ideals

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5741889)