Cyclic sums, network sharing, and restricted edge cuts in graphs with long cycles

DOI10.1002/net.20243zbMath1151.05029OpenAlexW4251165316MaRDI QIDQ3548725

Dieter Rautenbach, Lutz Volkmann

Publication date: 17 December 2008

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://www.db-thueringen.de/receive/dbt_mods_00009352

zbMATH Keywords

network reliabilityring topologyrestricted edge connectivityarbitrarily vertex decomposable graphnetwork sharing

Mathematics Subject Classification ID

Paths and cycles (05C38)

Related Items

Maximally edge-connected and vertex-connected graphs and digraphs: A survey

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Degree conditions for restricted-edge-connectivity and isoperimetric-edge-connectivity to be optimal
• On partitioning of hypergraphs
• Arbitrarily vertex decomposable suns with few rays
• On computing a conditional edge-connectivity of a graph
• Decomposable trees: A polynomial algorithm for tripodes
• Cuts leaving components of given minimum order
• Edge-cuts leaving components of order at least three
• Conditional edge connectivity properties, reliability comparisons and transitivity of graphs
• A degree bound on decomposable trees
• A proof of an inequality concerning \(k\)-restricted edge connectivity
• Edge cuts leaving components of order at least \(m\)
• On Bounds for the k-Partitioning of Graphs
• On arbitraly vertex decomposable unicyclic graphs with dominating cycle