scientific article; zbMATH DE number 1332751
From MaRDI portal
Publication:4260012
DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0037(199803)31:2<61::AID-NET1>3.0.CO;2-H" /><61::AID-NET1>3.0.CO;2-H 10.1002/(SICI)1097-0037(199803)31:2<61::AID-NET1>3.0.CO;2-HzbMath0929.05052MaRDI QIDQ4260012
Publication date: 10 January 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Reliability, availability, maintenance, inspection in operations research (90B25) Connectivity (05C40)
Related Items (41)
On a kind of restricted edge connectivity of graphs ⋮ Restricted arc-connectivity of digraphs ⋮ On edge cut of graphs leaving components of order at least five ⋮ A bound on 4-restricted edge connectivity of graphs ⋮ Joins of circulant matrices ⋮ Sufficient conditions for optimally and super m-restricted edge-connected graphs with given girth ⋮ Optimization problems of the third edge-connectivity of graphs ⋮ A new approach to finding the extra connectivity of graphs ⋮ On restricted edge-connectivity of lexicographic product graphs ⋮ The Restricted Edge-Connectivity of Kronecker Product Graphs ⋮ On maximal 3-restricted edge connectivity and reliability analysis of hypercube networks ⋮ On super restricted edge connectivity of half vertex transitive graphs ⋮ Optimally restricted edge connected elementary Harary graphs ⋮ Network reliability: Heading out on the highway ⋮ On optimizing edge connectivity of product graphs ⋮ Super restricted edge connectivity of regular graphs with two orbits ⋮ On restricted edge-connectivity of replacement product graphs ⋮ Sufficient conditions for maximally restricted edge connected graphs ⋮ A recursive formula for the reliability of a \(r\)-uniform complete hypergraph and its applications ⋮ Maximally edge-connected and vertex-connected graphs and digraphs: A survey ⋮ Sufficient conditions for restricted-edge-connectivity to be optimal ⋮ Extra edge connectivity and isoperimetric edge connectivity ⋮ Edge fault tolerance analysis of super \(k\)-restricted connected networks ⋮ Super restricted edge-connectivity of vertex-transitive graphs ⋮ Automorphisms of endomorphism semigroups of reflexive digraphs ⋮ Super edge-connectivity of de Bruijn and Kautz undirected graphs ⋮ On super restricted edge-connectivity of edge-transitive graphs ⋮ Super restricted edge connectivity of regular graphs ⋮ Cuts leaving components of given minimum order ⋮ Super restricted edge connected Cartesian product graphs ⋮ Neighborhood conditions for graphs to be super restricted edge connected ⋮ Super \(p\)-restricted edge connectivity of line graphs ⋮ Diameter-sufficient conditions for a graph to be super-restricted connected ⋮ On 3-restricted edge connectivity of undirected binary Kautz graphs ⋮ Sufficient conditions for super \(k\)-restricted edge connectivity in graphs of diameter 2 ⋮ On the 3-restricted edge connectivity of permutation graphs ⋮ Sufficient conditions for \(\lambda'\)-optimality in graphs of diameter 2 ⋮ On the construction of most reliable networks ⋮ On conditional edge-connectivity of graphs ⋮ Edge cuts leaving components of order at least \(m\) ⋮ Arc fault tolerance of Kautz digraphs
This page was built for publication:
