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

DOI10.1002/NET.20243MaRDI QIDQ3548725zbMATH OpenOpenAlexFDO

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

Recommendations

• Edge-cut cycles and cutting numbers of cycles and graphs
• scientific article; zbMATH DE number 4162913
• Graphs with almost all edges in long cycles
• Characterization of graphs with infinite cyclic edge connectivity
• scientific article; zbMATH DE number 986973

Cites work

• scientific article; zbMATH DE number 432834 (Why is no real title available?)
• scientific article; zbMATH DE number 3603293 (Why is no real title available?)
• scientific article; zbMATH DE number 1026281 (Why is no real title available?)
• scientific article; zbMATH DE number 5238175 (Why is no real title available?)
• A degree bound on decomposable trees
• A proof of an inequality concerning \(k\)-restricted edge connectivity
• Arbitrarily vertex decomposable suns with few rays
• Arbitrarily vertex decomposable trees are of maximum degree at most six
• Conditional edge connectivity properties, reliability comparisons and transitivity of graphs
• Cuts leaving components of given minimum order
• Decomposable trees: A polynomial algorithm for tripodes
• Degree conditions for restricted-edge-connectivity and isoperimetric-edge-connectivity to be optimal
• Edge cuts leaving components of order at least \(m\)
• Edge-cuts leaving components of order at least three
• On Bounds for the k-Partitioning of Graphs
• On arbitraly vertex decomposable unicyclic graphs with dominating cycle
• On computing a conditional edge-connectivity of a graph
• On partitioning of hypergraphs

Cited in

(1)

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

This page was built for publication: Cyclic sums, network sharing, and restricted edge cuts in graphs with long cycles

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