scientific article; zbMATH DE number 7085090

MaRDI QIDQ5224846zbMATH OpenFDO

Authors Thomas Lange

Publication date 24 July 2019

zbMATH Keywords

$k$-edge connected unreliabilityall-terminal unreliabilityalmost minimal cutsFPRAS

Mathematics Subject Classification ID

Connectivity (05C40) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph algorithms (graph-theoretic aspects) (05C85) Deterministic network models in operations research (90B10)

Recommendations

• Edge realizability of connected simple graphs
• The k-restricted edge connectivity of undirected Kautz graphs
• The \(p\)-restricted edge-connectivity of Kneser graphs
• The maximal restricted edge connectivity of Kautz undirected graphs
• Connectedness in structures on the real numbers: o-minimality and undecidability
• A proof of an inequality concerning \(k\)-restricted edge connectivity
• scientific article; zbMATH DE number 1159184
• Graph-theoretical conditions for inscribability and Delaunay realizability
• The restricted edge-connectivity of Kautz undirected graphs.
• Realizability and uniqueness in graphs

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 Q5224846)