On the construction of most reliable networks
From MaRDI portal
Publication:1827833
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
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
This page was built for publication: On the construction of most reliable networks