On the construction of most reliable networks

DOI10.1016/j.dam.2003.06.003zbMath1043.05069OpenAlexW2012297436MaRDI QIDQ1827833

Rongheng Li, Hanyuan Deng, Qiaoliang Li, Jian'er Chen, Qi-Ju Gao

Publication date: 6 August 2004

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2003.06.003

zbMATH Keywords

ReliabilityConnectivityHarary graphCirculant graphRestricted edge

Mathematics Subject Classification ID

Connectivity (05C40)

Related Items (6)

Sufficient conditions for \(k\)-restricted edge connected graphs ⋮ Optimally restricted edge connected elementary Harary graphs ⋮ A method to calculate the number of spanning connected unicyclic(bicyclic) subgraphs in 2-separable networks ⋮ Uniformly optimally reliable graphs: A survey ⋮ Sufficient conditions for graphs with girth \(g\) to be maximally \(k\)-restricted edge connected ⋮ Maximally edge-connected and vertex-connected graphs and digraphs: A survey

Cites Work

• On computing a conditional edge-connectivity of a graph
• Super Line-Connectivity Properties of Circulant Graphs
• Combinatorial optimization problems in the analysis and design of probabilistic networks
• The structure of max ?-minm?+1 graphs used in the design of reliable networks
• Unnamed Item
• Unnamed Item

This page was built for publication: On the construction of most reliable networks