On a kind of reliability analysis of networks

DOI10.1016/J.AMC.2011.08.010MaRDI QIDQ425460zbMATH OpenOpenAlexFDO

Authors Litao Guo, Weihua Yang, Xiaofeng Guo

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

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

Recommendations

• Minimally 3-restricted edge connected graphs
• Sufficient conditions for \(\lambda_3\)-optimality of triangle-free graphs
• Degree conditions for graphs to be \(\lambda_3\)-optimal and super-\(\lambda _3\)
• Local restricted edge connectivity and restricted edge connectivity of graphs.
• Sufficient conditions for k-restricted edge connected graphs

Cites work

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

Cited in

(21)

• Relative Network Observability and Its Relation With Network Observability
• scientific article; zbMATH DE number 6719821 (Why is no real title available?)
• A decomposition algorithm for network reliability evaluation
• scientific article; zbMATH DE number 3854781 (Why is no real title available?)
• scientific article; zbMATH DE number 5711483 (Why is no real title available?)
• scientific article; zbMATH DE number 7300382 (Why is no real title available?)
• Reliability Evaluation of BC Networks in Terms of the Extra Vertex- and Edge-Connectivity
• k-restricted edge connectivity in (p+1)-clique-free graphs
• scientific article; zbMATH DE number 1218895 (Why is no real title available?)
• Optimization problems of the third edge-connectivity of graphs
• scientific article; zbMATH DE number 583983 (Why is no real title available?)
• On the reliability function of a simple computer network in a random environment
• Reliability and Fail-Softness Analysis of Multistage Interconnection Networks
• The \(p\)-restricted edge-connectivity of Kneser graphs
• Sufficient conditions for graphs with girth \(g\) to be maximally \(k\)-restricted edge connected
• scientific article; zbMATH DE number 5896038 (Why is no real title available?)
• A cross entropy approach to design of reliable networks
• A Survey of Network Reliability and Domination Theory
• scientific article; zbMATH DE number 3878650 (Why is no real title available?)
• Network reliability and acyclic orientations
• On Reliability Evaluation by Network Decomposition

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

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