On a kind of reliability analysis of networks

DOI10.1016/J.AMC.2011.08.010zbMath1244.05133OpenAlexW2050399414MaRDI QIDQ425460

Xiaofeng Guo, Litao Guo, Weihua Yang

Publication date: 8 June 2012

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2011.08.010

zbMATH Keywords

networksgirth3-restricted edge connectivity3-restricted edge cut

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Reliability, testing and fault tolerance of networks and computer systems (68M15) Connectivity (05C40)

Related Items (3)

Sufficient conditions for graphs with girth \(g\) to be maximally \(k\)-restricted edge connected ⋮ \(k\)-restricted edge connectivity in \((p+1)\)-clique-free graphs ⋮ The \(p\)-restricted edge-connectivity of Kneser graphs

Cites Work

• On computing a conditional edge-connectivity of a graph
• Edge-cuts leaving components of order at least three
• Conditional edge connectivity properties, reliability comparisons and transitivity of graphs

This page was built for publication: On a kind of reliability analysis of networks