Restricted arc-connectivity of digraphs
From MaRDI portal
Publication:2379978
DOI10.1016/j.ipl.2007.04.004zbMath1183.05046OpenAlexW2076958772MaRDI QIDQ2379978
Publication date: 24 March 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2007.04.004
complexityfault toleranceedge-connectivityarc-connectivityrestricted edge-connectivityrestricted arc-connectivity
Related Items (24)
Strong articulation points and strong bridges in large scale graphs ⋮ Arc fault tolerance of Cartesian product of regular digraphs on super-restricted arc-connectivity ⋮ Restricted connectivity of total digraph ⋮ \(\{2,3\}\)-extraconnectivities of hypercube-like networks ⋮ A new approach to finding the extra connectivity of graphs ⋮ 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 ⋮ Finding strong bridges and strong articulation points in linear time ⋮ \(\lambda^{\prime}\)-optimality of bipartite digraphs ⋮ Restricted arc-connectivity in tournaments ⋮ Restricted arc-connectivity of bipartite tournaments ⋮ Maximally edge-connected and vertex-connected graphs and digraphs: A survey ⋮ 3-restricted arc connectivity of digraphs ⋮ Cyclic arc-connectivity in a Cartesian product digraph ⋮ \(\lambda ^{\prime}\)-optimal digraphs ⋮ 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 ⋮ Arc fault tolerance of Kautz digraphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On computing a conditional edge-connectivity of a graph
- Sufficient conditions for \(\lambda'\)-optimality in graphs of diameter 2
- Conditional connectivity
- Fault tolerance measures for m-ary n-dimensional hypercubes based on forbidden faulty sets
- Sufficient conditions for graphs to be ??-optimal, super-edge-connected, and maximally edge-connected
- Sufficient conditions for λ′‐optimality in graphs with girth g
- On restricted edge-connectivity of graphs.
This page was built for publication: Restricted arc-connectivity of digraphs
