\(\lambda ^{\prime}\)-optimal digraphs

DOI10.1016/j.ipl.2008.07.008zbMath1191.68093OpenAlexW88080339MaRDI QIDQ975499

Shang-Wei Lin, Shi-ying Wang

Publication date: 9 June 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2008.07.008

zbMATH Keywords

fault tolerancerestricted edge-connectivityrestricted arc-connectivity

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items

Arc fault tolerance of Cartesian product of regular digraphs on super-restricted arc-connectivity ⋮ On the super‐restricted arc‐connectivity of s ‐geodetic digraphs ⋮ On the restricted arc-connectivity of \(s\)-geodetic digraphs ⋮ Restricted arc connectivity of unidirectional hypercubes and unidirectional folded hypercubes ⋮ Restricted arc-connectivity of unidirectional star graphs ⋮ Restricted arc-connectivity of generalized \(p\)-cycles ⋮ Cartesian product digraphs with optimal restricted arc connectivity ⋮ \(\lambda^{\prime}\)-optimality of bipartite digraphs ⋮ Restricted arc-connectivity in tournaments ⋮ Restricted arc-connectivity of bipartite tournaments ⋮ 3-restricted arc connectivity of digraphs ⋮ Cyclic arc-connectivity in a Cartesian product digraph ⋮ A note on the restricted arc connectivity of oriented graphs of girth four ⋮ The restricted arc connectivity of Cartesian product digraphs ⋮ Bounds on the \(k\)-restricted arc connectivity of some bipartite tournaments ⋮ On the optimality of 3-restricted arc connectivity for digraphs and bipartite digraphs

Cites Work

• Unnamed Item
• Maximally edge-connected and vertex-connected graphs and digraphs: A survey
• Sufficient conditions for \(\lambda ^{\prime}\)-optimality of graphs with small conditional diameter
• On computing a conditional edge-connectivity of a graph
• Sufficient conditions for \(\lambda'\)-optimality in graphs of diameter 2
• Conditional edge connectivity properties, reliability comparisons and transitivity of graphs
• Restricted arc-connectivity of digraphs
• The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
• Combinatorial optimization problems in the analysis and design of probabilistic networks
• Complexity of network reliability computations
• Sufficient conditions for λ′‐optimality in graphs with girth g
• On restricted edge-connectivity of graphs.